________________________________________________________________

Run Header: Complete YList Version try 5: /small pw steps

Run start:        31.01.2010 12:37:40
Input Data from:  dataset172.txt
Iteration limit:  500
NI iter. limit:   200

# of Customers  :300
# of Locations  :20
Ex.Facilities   :3
Total budget    :25000
Terror. attacks :3

Penalty Weight : 0,5
Update Policy  : 4-3 of last 10
pw inc. step   : 0,005

Coverage Ratio :0,153833333333333
Average f[i]   :4225
Average g[i,j] :1964,70588235294
Total demand   :16080
________________________________________________________________

## ITERATION 0 #######################


> Neighbours evaluated; 18
> Selected Move:	3300	1	-1	14	4000


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0    >new incumb.: 3300


> New S[]: 
	
	 1  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 1 #######################


> Neighbours evaluated; 81
> Selected Move:	3870	1	-1	3	9000


> New Y[]: 
	
	 2  3  4  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0    >new incumb.: 3870


> New S[]: 
	
	 0  0  1  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,5

## ITERATION 2 #######################


> Neighbours evaluated; 26
> Selected Move:	4820	1	-1	4	14000


> New Y[]: 
	
	 2  3  4  1  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0    >new incumb.: 4820


> New S[]: 
	
	 0  0  0  1  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,5

## ITERATION 3 #######################


> Neighbours evaluated; 66
> Selected Move:	6080	1	-1	5	18500


> New Y[]: 
	
	 2  3  4  1  1  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0    >new incumb.: 6080


> New S[]: 
	
	 0  0  0  1  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,5

## ITERATION 4 #######################


> Neighbours evaluated; 32
> Selected Move:	6500	1	-1	6	23000


> New Y[]: 
	
	 2  3  4  1  1  1  1  0  0  0  0  0  0  0  1  0  0  0  0  0    >new incumb.: 6500


> New S[]: 
	
	 0  0  0  0  0  1  1  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,5

## ITERATION 5 #######################


> Neighbours evaluated; 81
> Selected Move:	7570	3	0	9	24600


> New Y[]: 
	
	 0  3  4  1  1  1  1  0  0  2  0  0  0  0  1  0  0  0  0  0    >new incumb.: 7570


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0 
 > pw :0,5

## ITERATION 6 #######################


> Neighbours evaluated; 58
> Selected Move:	8220	3	3	17	24600


> New Y[]: 
	
	 0  3  4  0  1  1  1  0  0  2  0  0  0  0  1  0  0  1  0  0    >new incumb.: 8220


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0 
 > pw :0,495

## ITERATION 7 #######################


> Neighbours evaluated; 68
> Selected Move:	8560	3	6	19	24600


> New Y[]: 
	
	 0  3  4  0  1  1  0  0  0  2  0  0  0  0  1  0  0  1  0  1    >new incumb.: 8560


> New S[]: 
	
	 0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,49

## ITERATION 8 #######################


> Neighbours evaluated; 94
> Selected Move:	8921	3	4	16	25100


> New Y[]: 
	
	 0  3  4  0  0  1  0  0  0  2  0  0  0  0  1  0  1  1  0  1 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,485

## ITERATION 9 #######################


> Neighbours evaluated; 88
> Selected Move:	8970	4	9	14	25000


> New Y[]: 
	
	 0  3  4  0  0  1  0  0  0  1  0  0  0  0  2  0  1  1  0  1    >new incumb.: 8970


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,48

## ITERATION 10 #######################


> Neighbours evaluated; 88
> Selected Move:	8970	4	14	16	23600


> New Y[]: 
	
	 0  3  4  0  0  1  0  0  0  1  0  0  0  0  1  0  2  1  0  1 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,475

## ITERATION 11 #######################


> Neighbours evaluated; 101
> Selected Move:	9140	3	16	13	24400


> New Y[]: 
	
	 0  3  4  0  0  1  0  0  0  1  0  0  0  2  1  0  0  1  0  1    >new incumb.: 9140


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  1 
 > pw :0,47

## ITERATION 12 #######################


> Neighbours evaluated; 100
> Selected Move:	9430	3	14	7	24900


> New Y[]: 
	
	 0  3  4  0  0  1  0  1  0  1  0  0  0  2  0  0  0  1  0  1    >new incumb.: 9430


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  1 
 > pw :0,465

## ITERATION 13 #######################


> Neighbours evaluated; 91
> Selected Move:	9470	3	13	8	24300


> New Y[]: 
	
	 0  3  4  0  0  1  0  1  2  1  0  0  0  0  0  0  0  1  0  1    >new incumb.: 9470


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  1 
 > pw :0,46

## ITERATION 14 #######################


> Neighbours evaluated; 100
> Selected Move:	9378	4	8	17	25200


> New Y[]: 
	
	 0  3  4  0  0  1  0  1  1  1  0  0  0  0  0  0  0  2  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  1 
 > pw :0,455

## ITERATION 15 #######################


> Neighbours evaluated; 91
> Selected Move:	9339	3	8	13	25200


> New Y[]: 
	
	 0  3  4  0  0  1  0  1  0  1  0  0  0  1  0  0  0  2  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  1 
 > pw :0,45

## ITERATION 16 #######################


> Neighbours evaluated; 88
> Selected Move:	9605	3	17	16	25100


> New Y[]: 
	
	 0  3  4  0  0  1  0  1  0  1  0  0  0  1  0  0  2  0  0  1 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,445

## ITERATION 17 #######################


> Neighbours evaluated; 87
> Selected Move:	9472	4	16	13	25400


> New Y[]: 
	
	 0  3  4  0  0  1  0  1  0  1  0  0  0  2  0  0  1  0  0  1 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,45

## ITERATION 18 #######################


> Neighbours evaluated; 92
> Selected Move:	9170	3	9	14	25400


> New Y[]: 
	
	 0  3  4  0  0  1  0  1  0  0  0  0  0  2  1  0  1  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  1 
 > pw :0,455

## ITERATION 19 #######################


> Neighbours evaluated; 67
> Selected Move:	9350	3	16	17	24900


> New Y[]: 
	
	 0  3  4  0  0  1  0  1  0  0  0  0  0  2  1  0  0  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  1 
 > pw :0,46

## ITERATION 20 #######################


> Neighbours evaluated; 74
> Selected Move:	9258	4	13	17	25200


> New Y[]: 
	
	 0  3  4  0  0  1  0  1  0  0  0  0  0  1  1  0  0  2  0  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  1 
 > pw :0,465

## ITERATION 21 #######################


> Neighbours evaluated; 73
> Selected Move:	9304	3	17	16	25100


> New Y[]: 
	
	 0  3  4  0  0  1  0  1  0  0  0  0  0  1  1  0  2  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  1 
 > pw :0,47

## ITERATION 22 #######################


> Neighbours evaluated; 78
> Selected Move:	9193	3	7	15	25100


> New Y[]: 
	
	 0  3  4  0  0  1  0  0  0  0  0  0  0  1  1  1  2  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  1 
 > pw :0,475

## ITERATION 23 #######################


> Neighbours evaluated; 82
> Selected Move:	9272	3	14	9	25100


> New Y[]: 
	
	 0  3  4  0  0  1  0  0  0  1  0  0  0  1  0  1  2  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  1  0  0  0 
 > pw :0,48

## ITERATION 24 #######################


> Neighbours evaluated; 100
> Selected Move:	9140	3	15	14	24600


> New Y[]: 
	
	 0  3  4  0  0  1  0  0  0  1  0  0  0  1  1  0  2  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  1 
 > pw :0,485

## ITERATION 25 #######################


> Neighbours evaluated; 99
> Selected Move:	9140	4	16	13	24900


> New Y[]: 
	
	 0  3  4  0  0  1  0  0  0  1  0  0  0  2  1  0  1  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  1 
 > pw :0,49

## ITERATION 26 #######################


> Neighbours evaluated; 102
> Selected Move:	9124	3	14	15	25400


> New Y[]: 
	
	 0  3  4  0  0  1  0  0  0  1  0  0  0  2  0  1  1  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  1  0  0  0 
 > pw :0,495

## ITERATION 27 #######################


> Neighbours evaluated; 101
> Selected Move:	9080	3	16	17	24900


> New Y[]: 
	
	 0  3  4  0  0  1  0  0  0  1  0  0  0  2  0  1  0  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  1 
 > pw :0,5

## ITERATION 28 #######################


> Neighbours evaluated; 101
> Selected Move:	9120	3	13	8	24300


> New Y[]: 
	
	 0  3  4  0  0  1  0  0  2  1  0  0  0  0  0  1  0  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  1 
 > pw :0,505

## ITERATION 29 #######################


> Neighbours evaluated; 97
> Selected Move:	9100	3	9	14	24300


> New Y[]: 
	
	 0  3  4  0  0  1  0  0  2  0  0  0  0  0  1  1  0  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  1 
 > pw :0,51

## ITERATION 30 #######################


> Neighbours evaluated; 83
> Selected Move:	9210	3	15	7	24300


> New Y[]: 
	
	 0  3  4  0  0  1  0  1  2  0  0  0  0  0  1  0  0  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  1 
 > pw :0,505

## ITERATION 31 #######################


> Neighbours evaluated; 84
> Selected Move:	9210	3	19	3	24800


> New Y[]: 
	
	 0  3  4  1  0  1  0  1  2  0  0  0  0  0  1  0  0  1  0  0 


> New S[]: 
	
	 0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,5

## ITERATION 32 #######################


> Neighbours evaluated; 89
> Selected Move:	9250	3	14	9	24800


> New Y[]: 
	
	 0  3  4  1  0  1  0  1  2  1  0  0  0  0  0  0  0  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  1  0  0 
 > pw :0,495

## ITERATION 33 #######################


> Neighbours evaluated; 90
> Selected Move:	9082	3	8	13	25400


> New Y[]: 
	
	 0  3  4  1  0  1  0  1  0  1  0  0  0  2  0  0  0  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  1  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,49

## ITERATION 34 #######################


> Neighbours evaluated; 90
> Selected Move:	9034	3	9	14	25400


> New Y[]: 
	
	 0  3  4  1  0  1  0  1  0  0  0  0  0  2  1  0  0  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  1  0  0 
 > pw :0,485

## ITERATION 35 #######################


> Neighbours evaluated; 78
> Selected Move:	9020	3	7	9	24900


> New Y[]: 
	
	 0  3  4  1  0  1  0  0  0  1  0  0  0  2  1  0  0  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  1  0  0 
 > pw :0,48

## ITERATION 36 #######################


> Neighbours evaluated; 97
> Selected Move:	9000	3	13	8	24300


> New Y[]: 
	
	 0  3  4  1  0  1  0  0  2  1  0  0  0  0  1  0  0  1  0  0 


> New S[]: 
	
	 0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,475

## ITERATION 37 #######################


> Neighbours evaluated; 96
> Selected Move:	9000	3	3	19	23800


> New Y[]: 
	
	 0  3  4  0  0  1  0  0  2  1  0  0  0  0  1  0  0  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  1 
 > pw :0,47

## ITERATION 38 #######################


> Neighbours evaluated; 94
> Selected Move:	9000	4	8	17	24700


> New Y[]: 
	
	 0  3  4  0  0  1  0  0  1  1  0  0  0  0  1  0  0  2  0  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  1 
 > pw :0,465

## ITERATION 39 #######################


> Neighbours evaluated; 95
> Selected Move:	9140	3	8	13	24700


> New Y[]: 
	
	 0  3  4  0  0  1  0  0  0  1  0  0  0  1  1  0  0  2  0  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  1 
 > pw :0,46

## ITERATION 40 #######################


> Neighbours evaluated; 100
> Selected Move:	9094	4	17	19	25100


> New Y[]: 
	
	 0  3  4  0  0  1  0  0  0  1  0  0  0  1  1  0  0  1  0  2 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  1 
 > pw :0,455

## ITERATION 41 #######################


> Neighbours evaluated; 99
> Selected Move:	9157	3	14	7	25600


> New Y[]: 
	
	 0  3  4  0  0  1  0  1  0  1  0  0  0  1  0  0  0  1  0  2 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  1 
 > pw :0,45

## ITERATION 42 #######################


> Neighbours evaluated; 91
> Selected Move:	9200	3	13	8	25600


> New Y[]: 
	
	 0  3  4  0  0  1  0  1  1  1  0  0  0  0  0  0  0  1  0  2 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  1 
 > pw :0,455

## ITERATION 43 #######################


> Neighbours evaluated; 96
> Selected Move:	8970	4	19	9	26100


> New Y[]: 
	
	 0  3  4  0  0  1  0  1  1  2  0  0  0  0  0  0  0  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  1 
 > pw :0,46

## ITERATION 44 #######################


> Neighbours evaluated; 92
> Selected Move:	8924	3	8	13	26100


> New Y[]: 
	
	 0  3  4  0  0  1  0  1  0  2  0  0  0  1  0  0  0  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  1 
 > pw :0,465

## ITERATION 45 #######################


> Neighbours evaluated; 89
> Selected Move:	8906	3	17	16	26600


> New Y[]: 
	
	 0  3  4  0  0  1  0  1  0  2  0  0  0  1  0  0  1  0  0  1 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,47

## ITERATION 46 #######################


> Neighbours evaluated; 72
> Selected Move:	9133	4	9	19	26100


> New Y[]: 
	
	 0  3  4  0  0  1  0  1  0  1  0  0  0  1  0  0  1  0  0  2 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,475

## ITERATION 47 #######################


> Neighbours evaluated; 88
> Selected Move:	8892	3	13	17	25100


> New Y[]: 
	
	 0  3  4  0  0  1  0  1  0  1  0  0  0  0  0  0  1  1  0  2 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,48

## ITERATION 48 #######################


> Neighbours evaluated; 87
> Selected Move:	8970	3	7	14	24600


> New Y[]: 
	
	 0  3  4  0  0  1  0  0  0  1  0  0  0  0  1  0  1  1  0  2 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,485

## ITERATION 49 #######################


> Neighbours evaluated; 91
> Selected Move:	8970	4	19	17	24200


> New Y[]: 
	
	 0  3  4  0  0  1  0  0  0  1  0  0  0  0  1  0  1  2  0  1 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,49

## ITERATION 50 #######################


> Neighbours evaluated; 92
> Selected Move:	9000	3	17	8	24300


> New Y[]: 
	
	 0  3  4  0  0  1  0  0  2  1  0  0  0  0  1  0  1  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  1 
 > pw :0,495

## ITERATION 51 #######################


> Neighbours evaluated; 95
> Selected Move:	9020	3	9	7	24800


> New Y[]: 
	
	 0  3  4  0  0  1  0  1  2  0  0  0  0  0  1  0  1  0  0  1 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,5

## ITERATION 52 #######################


> Neighbours evaluated; 83
> Selected Move:	9060	3	5	17	25300


> New Y[]: 
	
	 0  3  4  0  0  0  0  1  2  0  0  0  0  0  1  0  1  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  1 
 > pw :0,505

## ITERATION 53 #######################


> Neighbours evaluated; 36
> Selected Move:	9328	3	14	9	25300


> New Y[]: 
	
	 0  3  4  0  0  0  0  1  2  1  0  0  0  0  0  0  1  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  1 
 > pw :0,51

## ITERATION 54 #######################


> Neighbours evaluated; 53
> Selected Move:	9174	4	8	16	25600


> New Y[]: 
	
	 0  3  4  0  0  0  0  1  1  1  0  0  0  0  0  0  2  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  1 
 > pw :0,515

## ITERATION 55 #######################


> Neighbours evaluated; 52
> Selected Move:	9131	3	8	13	25600


> New Y[]: 
	
	 0  3  4  0  0  0  0  1  0  1  0  0  0  1  0  0  2  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  1 
 > pw :0,52

## ITERATION 56 #######################


> Neighbours evaluated; 55
> Selected Move:	9228	3	17	6	25100


> New Y[]: 
	
	 0  3  4  0  0  0  1  1  0  1  0  0  0  1  0  0  2  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  1 
 > pw :0,525

## ITERATION 57 #######################


> Neighbours evaluated; 58
> Selected Move:	9070	4	16	13	25400


> New Y[]: 
	
	 0  3  4  0  0  0  1  1  0  1  0  0  0  2  0  0  1  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  1 
 > pw :0,53

## ITERATION 58 #######################


> Neighbours evaluated; 62
> Selected Move:	9020	3	13	8	24800


> New Y[]: 
	
	 0  3  4  0  0  0  1  1  2  1  0  0  0  0  0  0  1  0  0  1 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,535

## ITERATION 59 #######################


> Neighbours evaluated; 62
> Selected Move:	9020	3	6	5	24800


> New Y[]: 
	
	 0  3  4  0  0  1  0  1  2  1  0  0  0  0  0  0  1  0  0  1 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,54

## ITERATION 60 #######################


> Neighbours evaluated; 94
> Selected Move:	8966	4	8	16	25100


> New Y[]: 
	
	 0  3  4  0  0  1  0  1  1  1  0  0  0  0  0  0  2  0  0  1 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,545

## ITERATION 61 #######################


> Neighbours evaluated; 95
> Selected Move:	9000	3	7	14	24600


> New Y[]: 
	
	 0  3  4  0  0  1  0  0  1  1  0  0  0  0  1  0  2  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  1 
 > pw :0,55

## ITERATION 62 #######################


> Neighbours evaluated; 93
> Selected Move:	8965	3	9	7	25100


> New Y[]: 
	
	 0  3  4  0  0  1  0  1  1  0  0  0  0  0  1  0  2  0  0  1 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,555

## ITERATION 63 #######################


> Neighbours evaluated; 84
> Selected Move:	9099	3	16	17	25200


> New Y[]: 
	
	 0  3  4  0  0  1  0  1  1  0  0  0  0  0  1  0  0  2  0  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  1 
 > pw :0,56

## ITERATION 64 #######################


> Neighbours evaluated; 75
> Selected Move:	8988	3	7	15	25200


> New Y[]: 
	
	 0  3  4  0  0  1  0  0  1  0  0  0  0  0  1  1  0  2  0  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  1 
 > pw :0,565

## ITERATION 65 #######################


> Neighbours evaluated; 76
> Selected Move:	9007	3	14	9	25200


> New Y[]: 
	
	 0  3  4  0  0  1  0  0  1  1  0  0  0  0  0  1  0  2  0  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  1 
 > pw :0,57

## ITERATION 66 #######################


> Neighbours evaluated; 90
> Selected Move:	8966	3	8	13	25200


> New Y[]: 
	
	 0  3  4  0  0  1  0  0  0  1  0  0  0  1  0  1  0  2  0  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  1 
 > pw :0,575

## ITERATION 67 #######################


> Neighbours evaluated; 96
> Selected Move:	8965	3	9	14	25200


> New Y[]: 
	
	 0  3  4  0  0  1  0  0  0  0  0  0  0  1  1  1  0  2  0  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  1 
 > pw :0,58

## ITERATION 68 #######################


> Neighbours evaluated; 74
> Selected Move:	9080	4	17	13	24900


> New Y[]: 
	
	 0  3  4  0  0  1  0  0  0  0  0  0  0  2  1  1  0  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  1 
 > pw :0,585

## ITERATION 69 #######################


> Neighbours evaluated; 83
> Selected Move:	9006	3	17	16	25400


> New Y[]: 
	
	 0  3  4  0  0  1  0  0  0  0  0  0  0  2  1  1  1  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  1 
 > pw :0,59

## ITERATION 70 #######################


> Neighbours evaluated; 83
> Selected Move:	8750	3	13	8	24800


> New Y[]: 
	
	 0  3  4  0  0  1  0  0  2  0  0  0  0  0  1  1  1  0  0  1 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,595

## ITERATION 71 #######################


> Neighbours evaluated; 84
> Selected Move:	8921	3	5	17	25300


> New Y[]: 
	
	 0  3  4  0  0  0  0  0  2  0  0  0  0  0  1  1  1  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  1 
 > pw :0,6

## ITERATION 72 #######################


> Neighbours evaluated; 49
> Selected Move:	9000	3	15	9	24800


> New Y[]: 
	
	 0  3  4  0  0  0  0  0  2  1  0  0  0  0  1  0  1  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  1 
 > pw :0,605

## ITERATION 73 #######################


> Neighbours evaluated; 56
> Selected Move:	8970	3	19	5	24800


> New Y[]: 
	
	 0  3  4  0  0  1  0  0  2  1  0  0  0  0  1  0  1  1  0  0 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,61

## ITERATION 74 #######################


> Neighbours evaluated; 91
> Selected Move:	9000	3	17	3	24800


> New Y[]: 
	
	 0  3  4  1  0  1  0  0  2  1  0  0  0  0  1  0  1  0  0  0 


> New S[]: 
	
	 0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,615

## ITERATION 75 #######################


> Neighbours evaluated; 90
> Selected Move:	8970	3	8	17	24700


> New Y[]: 
	
	 0  3  4  1  0  1  0  0  0  1  0  0  0  0  1  0  1  2  0  0 


> New S[]: 
	
	 0  1  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,61

## ITERATION 76 #######################


> Neighbours evaluated; 91
> Selected Move:	8970	4	17	3	25000


> New Y[]: 
	
	 0  3  4  2  0  1  0  0  0  1  0  0  0  0  1  0  1  1  0  0 


> New S[]: 
	
	 0  1  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,605

## ITERATION 77 #######################


> Neighbours evaluated; 84
> Selected Move:	8970	4	3	16	24100


> New Y[]: 
	
	 0  3  4  1  0  1  0  0  0  1  0  0  0  0  1  0  2  1  0  0 


> New S[]: 
	
	 0  1  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,6

## ITERATION 78 #######################


> Neighbours evaluated; 94
> Selected Move:	8960	3	17	13	25100


> New Y[]: 
	
	 0  3  4  1  0  1  0  0  0  1  0  0  0  1  1  0  2  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  1  0  0  0 
 > pw :0,595

## ITERATION 79 #######################


> Neighbours evaluated; 92
> Selected Move:	9033	3	14	7	25600


> New Y[]: 
	
	 0  3  4  1  0  1  0  1  0  1  0  0  0  1  0  0  2  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  1  0  0  0 
 > pw :0,59

## ITERATION 80 #######################


> Neighbours evaluated; 83
> Selected Move:	8950	3	13	17	24600


> New Y[]: 
	
	 0  3  4  1  0  1  0  1  0  1  0  0  0  0  0  0  2  1  0  0 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,585

## ITERATION 81 #######################


> Neighbours evaluated; 91
> Selected Move:	8950	3	9	14	24600


> New Y[]: 
	
	 0  3  4  1  0  1  0  1  0  0  0  0  0  0  1  0  2  1  0  0 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,58

## ITERATION 82 #######################


> Neighbours evaluated; 80
> Selected Move:	8940	3	3	19	24100


> New Y[]: 
	
	 0  3  4  0  0  1  0  1  0  0  0  0  0  0  1  0  2  1  0  1 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,575

## ITERATION 83 #######################


> Neighbours evaluated; 83
> Selected Move:	9005	3	5	13	25600


> New Y[]: 
	
	 0  3  4  0  0  0  0  1  0  0  0  0  0  1  1  0  2  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  1 
 > pw :0,57

## ITERATION 84 #######################


> Neighbours evaluated; 41
> Selected Move:	9083	3	7	9	25100


> New Y[]: 
	
	 0  3  4  0  0  0  0  0  0  1  0  0  0  1  1  0  2  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  1 
 > pw :0,565

## ITERATION 85 #######################


> Neighbours evaluated; 55
> Selected Move:	8943	3	13	8	25100


> New Y[]: 
	
	 0  3  4  0  0  0  0  0  1  1  0  0  0  0  1  0  2  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  1 
 > pw :0,57

## ITERATION 86 #######################


> Neighbours evaluated; 54
> Selected Move:	8913	3	19	5	25100


> New Y[]: 
	
	 0  3  4  0  0  1  0  0  1  1  0  0  0  0  1  0  2  1  0  0 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,575

## ITERATION 87 #######################


> Neighbours evaluated; 91
> Selected Move:	8942	3	16	19	25100


> New Y[]: 
	
	 0  3  4  0  0  1  0  0  1  1  0  0  0  0  1  0  0  1  0  2 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  1 
 > pw :0,58

## ITERATION 88 #######################


> Neighbours evaluated; 90
> Selected Move:	8862	3	9	7	25600


> New Y[]: 
	
	 0  3  4  0  0  1  0  1  1  0  0  0  0  0  1  0  0  1  0  2 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  1 
 > pw :0,585

## ITERATION 89 #######################


> Neighbours evaluated; 73
> Selected Move:	8999	3	8	13	25600


> New Y[]: 
	
	 0  3  4  0  0  1  0  1  0  0  0  0  0  1  1  0  0  1  0  2 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  1 
 > pw :0,59

## ITERATION 90 #######################


> Neighbours evaluated; 70
> Selected Move:	8881	3	13	16	25100


> New Y[]: 
	
	 0  3  4  0  0  1  0  1  0  0  0  0  0  0  1  0  1  1  0  2 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,595

## ITERATION 91 #######################


> Neighbours evaluated; 68
> Selected Move:	8940	4	19	17	24700


> New Y[]: 
	
	 0  3  4  0  0  1  0  1  0  0  0  0  0  0  1  0  1  2  0  1 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,6

## ITERATION 92 #######################


> Neighbours evaluated; 76
> Selected Move:	8940	3	5	6	24700


> New Y[]: 
	
	 0  3  4  0  0  0  1  1  0  0  0  0  0  0  1  0  1  2  0  1 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,605

## ITERATION 93 #######################


> Neighbours evaluated; 47
> Selected Move:	9020	3	17	8	24800


> New Y[]: 
	
	 0  3  4  0  0  0  1  1  2  0  0  0  0  0  1  0  1  0  0  1 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,61

## ITERATION 94 #######################


> Neighbours evaluated; 39
> Selected Move:	8959	4	8	16	25100


> New Y[]: 
	
	 0  3  4  0  0  0  1  1  1  0  0  0  0  0  1  0  2  0  0  1 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,615

## ITERATION 95 #######################


> Neighbours evaluated; 44
> Selected Move:	9058	3	8	13	25100


> New Y[]: 
	
	 0  3  4  0  0  0  1  1  0  0  0  0  0  1  1  0  2  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  1 
 > pw :0,62

## ITERATION 96 #######################


> Neighbours evaluated; 40
> Selected Move:	8940	3	13	17	24100


> New Y[]: 
	
	 0  3  4  0  0  0  1  1  0  0  0  0  0  0  1  0  2  1  0  1 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,625

## ITERATION 97 #######################


> Neighbours evaluated; 53
> Selected Move:	8940	3	14	9	24100


> New Y[]: 
	
	 0  3  4  0  0  0  1  1  0  1  0  0  0  0  0  0  2  1  0  1 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,63

## ITERATION 98 #######################


> Neighbours evaluated; 68
> Selected Move:	8957	3	17	8	25100


> New Y[]: 
	
	 0  3  4  0  0  0  1  1  1  1  0  0  0  0  0  0  2  0  0  1 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,635

## ITERATION 99 #######################


> Neighbours evaluated; 69
> Selected Move:	8910	3	7	14	24600


> New Y[]: 
	
	 0  3  4  0  0  0  1  0  1  1  0  0  0  0  1  0  2  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  1 
 > pw :0,63

## ITERATION 100 #######################


> Neighbours evaluated; 65
> Selected Move:	8910	4	16	8	24300


> New Y[]: 
	
	 0  3  4  0  0  0  1  0  2  1  0  0  0  0  1  0  1  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  1 
 > pw :0,625

## ITERATION 101 #######################


> Neighbours evaluated; 75
> Selected Move:	8910	3	8	13	24900


> New Y[]: 
	
	 0  3  4  0  0  0  1  0  0  1  0  0  0  2  1  0  1  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  1 
 > pw :0,62

## ITERATION 102 #######################


> Neighbours evaluated; 68
> Selected Move:	8910	4	13	16	24600


> New Y[]: 
	
	 0  3  4  0  0  0  1  0  0  1  0  0  0  1  1  0  2  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  1 
 > pw :0,615

## ITERATION 103 #######################


> Neighbours evaluated; 79
> Selected Move:	8910	3	13	17	23600


> New Y[]: 
	
	 0  3  4  0  0  0  1  0  0  1  0  0  0  0  1  0  2  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  1 
 > pw :0,61

## ITERATION 104 #######################


> Neighbours evaluated; 65
> Selected Move:	8910	4	16	14	25000


> New Y[]: 
	
	 0  3  4  0  0  0  1  0  0  1  0  0  0  0  2  0  1  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  1 
 > pw :0,605

## ITERATION 105 #######################


> Neighbours evaluated; 52
> Selected Move:	8910	4	14	17	24200


> New Y[]: 
	
	 0  3  4  0  0  0  1  0  0  1  0  0  0  0  1  0  1  2  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  1 
 > pw :0,6

## ITERATION 106 #######################


> Neighbours evaluated; 60
> Selected Move:	8940	3	14	7	24700


> New Y[]: 
	
	 0  3  4  0  0  0  1  1  0  1  0  0  0  0  0  0  1  2  0  1 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,595

## ITERATION 107 #######################


> Neighbours evaluated; 59
> Selected Move:	8940	3	6	5	24700


> New Y[]: 
	
	 0  3  4  0  0  1  0  1  0  1  0  0  0  0  0  0  1  2  0  1 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,59

## ITERATION 108 #######################


> Neighbours evaluated; 79
> Selected Move:	9052	3	16	18	25200


> New Y[]: 
	
	 0  3  4  0  0  1  0  1  0  1  0  0  0  0  0  0  0  2  1  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  1  0  0 
 > pw :0,585

## ITERATION 109 #######################


> Neighbours evaluated; 71
> Selected Move:	9170	4	17	18	24900


> New Y[]: 
	
	 0  3  4  0  0  1  0  1  0  1  0  0  0  0  0  0  0  1  2  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  1  0  0 
 > pw :0,58

## ITERATION 110 #######################


> Neighbours evaluated; 86
> Selected Move:	8940	3	18	16	24100


> New Y[]: 
	
	 0  3  4  0  0  1  0  1  0  1  0  0  0  0  0  0  2  1  0  1 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,575

## ITERATION 111 #######################


> Neighbours evaluated; 90
> Selected Move:	8825	3	5	18	25600


> New Y[]: 
	
	 0  3  4  0  0  0  0  1  0  1  0  0  0  0  0  0  2  1  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  1  0  0 
 > pw :0,57

## ITERATION 112 #######################


> Neighbours evaluated; 81
> Selected Move:	8823	3	17	5	25100


> New Y[]: 
	
	 0  3  4  0  0  1  0  1  0  1  0  0  0  0  0  0  2  0  1  1 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,565

## ITERATION 113 #######################


> Neighbours evaluated; 84
> Selected Move:	8800	3	18	10	24600


> New Y[]: 
	
	 0  3  4  0  0  1  0  1  0  1  1  0  0  0  0  0  2  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  1  0  0  0 
 > pw :0,56

## ITERATION 114 #######################


> Neighbours evaluated; 95
> Selected Move:	8832	3	1	13	26300


> New Y[]: 
	
	 0  0  4  0  0  1  0  1  0  1  1  0  0  3  0  0  2  0  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  1 
 > pw :0,555

## ITERATION 115 #######################


> Neighbours evaluated; 92
> Selected Move:	8820	3	10	11	24800


> New Y[]: 
	
	 0  0  4  0  0  1  0  1  0  1  0  1  0  3  0  0  2  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  1  0  0  0 
 > pw :0,55

## ITERATION 116 #######################


> Neighbours evaluated; 91
> Selected Move:	8855	3	7	17	25300


> New Y[]: 
	
	 0  0  4  0  0  1  0  0  0  1  0  1  0  3  0  0  2  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  1 
 > pw :0,555

## ITERATION 117 #######################


> Neighbours evaluated; 88
> Selected Move:	8890	3	19	14	24800


> New Y[]: 
	
	 0  0  4  0  0  1  0  0  0  1  0  1  0  3  1  0  2  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  1  0  0 
 > pw :0,56

## ITERATION 118 #######################


> Neighbours evaluated; 92
> Selected Move:	8852	3	9	19	25300


> New Y[]: 
	
	 0  0  4  0  0  1  0  0  0  0  0  1  0  3  1  0  2  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  1 
 > pw :0,565

## ITERATION 119 #######################


> Neighbours evaluated; 84
> Selected Move:	8850	3	13	10	25300


> New Y[]: 
	
	 0  0  4  0  0  1  0  0  0  0  3  1  0  0  1  0  2  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  1 
 > pw :0,57

## ITERATION 120 #######################


> Neighbours evaluated; 66
> Selected Move:	8849	3	14	9	25300


> New Y[]: 
	
	 0  0  4  0  0  1  0  0  0  1  3  1  0  0  0  0  2  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  1 
 > pw :0,575

## ITERATION 121 #######################


> Neighbours evaluated; 85
> Selected Move:	8797	3	11	14	25300


> New Y[]: 
	
	 0  0  4  0  0  1  0  0  0  1  3  0  0  0  1  0  2  1  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1 
 > pw :0,58

## ITERATION 122 #######################


> Neighbours evaluated; 93
> Selected Move:	8796	3	5	6	25300


> New Y[]: 
	
	 0  0  4  0  0  0  1  0  0  1  3  0  0  0  1  0  2  1  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1 
 > pw :0,585

## ITERATION 123 #######################


> Neighbours evaluated; 73
> Selected Move:	8794	3	10	13	25300


> New Y[]: 
	
	 0  0  4  0  0  0  1  0  0  1  0  0  0  3  1  0  2  1  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  1 
 > pw :0,59

## ITERATION 124 #######################


> Neighbours evaluated; 85
> Selected Move:	8873	3	6	7	25300


> New Y[]: 
	
	 0  0  4  0  0  0  0  1  0  1  0  0  0  3  1  0  2  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  1  0  0 
 > pw :0,595

## ITERATION 125 #######################


> Neighbours evaluated; 83
> Selected Move:	8791	3	7	5	25300


> New Y[]: 
	
	 0  0  4  0  0  1  0  0  0  1  0  0  0  3  1  0  2  1  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  1 
 > pw :0,6

## ITERATION 126 #######################


> Neighbours evaluated; 96
> Selected Move:	9260	3	16	0	23700


> New Y[]: 
	
	 2  0  4  0  0  1  0  0  0  1  0  0  0  3  1  0  0  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  1 
 > pw :0,605

## ITERATION 127 #######################


> Neighbours evaluated; 101
> Selected Move:	9610	3	14	7	24200


> New Y[]: 
	
	 2  0  4  0  0  1  0  1  0  1  0  0  0  3  0  0  0  1  0  1    >new incumb.: 9610


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  1 
 > pw :0,61

## ITERATION 128 #######################


> Neighbours evaluated; 96
> Selected Move:	9620	3	13	8	25000


> New Y[]: 
	
	 2  0  4  0  0  1  0  1  3  1  0  0  0  0  0  0  0  1  0  1    >new incumb.: 9620


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,615

## ITERATION 129 #######################


> Neighbours evaluated; 92
> Selected Move:	9400	3	8	18	24300


> New Y[]: 
	
	 2  0  4  0  0  1  0  1  0  1  0  0  0  0  0  0  0  1  3  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  1  0  0 
 > pw :0,62

## ITERATION 130 #######################


> Neighbours evaluated; 91
> Selected Move:	9214	3	5	16	25300


> New Y[]: 
	
	 2  0  4  0  0  0  0  1  0  1  0  0  0  0  0  0  1  1  3  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  1  0  0 
 > pw :0,625

## ITERATION 131 #######################


> Neighbours evaluated; 81
> Selected Move:	9495	3	18	13	25200


> New Y[]: 
	
	 2  0  4  0  0  0  0  1  0  1  0  0  0  3  0  0  1  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  1 
 > pw :0,63

## ITERATION 132 #######################


> Neighbours evaluated; 59
> Selected Move:	9590	3	17	5	24700


> New Y[]: 
	
	 2  0  4  0  0  1  0  1  0  1  0  0  0  3  0  0  1  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  1 
 > pw :0,635

## ITERATION 133 #######################


> Neighbours evaluated; 86
> Selected Move:	9580	3	5	6	24700


> New Y[]: 
	
	 2  0  4  0  0  0  1  1  0  1  0  0  0  3  0  0  1  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  1 
 > pw :0,63

## ITERATION 134 #######################


> Neighbours evaluated; 63
> Selected Move:	9220	3	7	15	24700


> New Y[]: 
	
	 2  0  4  0  0  0  1  0  0  1  0  0  0  3  0  1  1  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  1 
 > pw :0,625

## ITERATION 135 #######################


> Neighbours evaluated; 75
> Selected Move:	9320	3	6	5	24700


> New Y[]: 
	
	 2  0  4  0  0  1  0  0  0  1  0  0  0  3  0  1  1  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  1 
 > pw :0,62

## ITERATION 136 #######################


> Neighbours evaluated; 102
> Selected Move:	9320	3	9	14	24700


> New Y[]: 
	
	 2  0  4  0  0  1  0  0  0  0  0  0  0  3  1  1  1  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  1 
 > pw :0,615

## ITERATION 137 #######################


> Neighbours evaluated; 82
> Selected Move:	9470	3	15	7	24700


> New Y[]: 
	
	 2  0  4  0  0  1  0  1  0  0  0  0  0  3  1  0  1  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  1 
 > pw :0,61

## ITERATION 138 #######################


> Neighbours evaluated; 76
> Selected Move:	9470	3	16	17	24200


> New Y[]: 
	
	 2  0  4  0  0  1  0  1  0  0  0  0  0  3  1  0  0  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  1 
 > pw :0,605

## ITERATION 139 #######################


> Neighbours evaluated; 83
> Selected Move:	9349	3	5	16	25200


> New Y[]: 
	
	 2  0  4  0  0  0  0  1  0  0  0  0  0  3  1  0  1  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  1 
 > pw :0,6

## ITERATION 140 #######################


> Neighbours evaluated; 48
> Selected Move:	9260	3	7	9	24700


> New Y[]: 
	
	 2  0  4  0  0  0  0  0  0  1  0  0  0  3  1  0  1  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  1 
 > pw :0,595

## ITERATION 141 #######################


> Neighbours evaluated; 54
> Selected Move:	9260	3	17	5	24200


> New Y[]: 
	
	 2  0  4  0  0  1  0  0  0  1  0  0  0  3  1  0  1  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  1 
 > pw :0,59

## ITERATION 142 #######################


> Neighbours evaluated; 101
> Selected Move:	9083	4	13	16	25300


> New Y[]: 
	
	 2  0  4  0  0  1  0  0  0  1  0  0  0  1  1  0  3  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  1 
 > pw :0,585

## ITERATION 143 #######################


> Neighbours evaluated; 102
> Selected Move:	9122	3	14	7	25800


> New Y[]: 
	
	 2  0  4  0  0  1  0  1  0  1  0  0  0  1  0  0  3  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  1 
 > pw :0,58

## ITERATION 144 #######################


> Neighbours evaluated; 85
> Selected Move:	9146	3	16	17	25800


> New Y[]: 
	
	 2  0  4  0  0  1  0  1  0  1  0  0  0  1  0  0  0  3  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  1 
 > pw :0,575

## ITERATION 145 #######################


> Neighbours evaluated; 82
> Selected Move:	9160	3	13	8	25800


> New Y[]: 
	
	 2  0  4  0  0  1  0  1  1  1  0  0  0  0  0  0  0  3  0  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,58

## ITERATION 146 #######################


> Neighbours evaluated; 88
> Selected Move:	8936	3	8	18	25800


> New Y[]: 
	
	 2  0  4  0  0  1  0  1  0  1  0  0  0  0  0  0  0  3  1  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  1  0  0 
 > pw :0,585

## ITERATION 147 #######################


> Neighbours evaluated; 83
> Selected Move:	8874	3	18	10	25300


> New Y[]: 
	
	 2  0  4  0  0  1  0  1  0  1  1  0  0  0  0  0  0  3  0  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  1  0  0 
 > pw :0,59

## ITERATION 148 #######################


> Neighbours evaluated; 88
> Selected Move:	9050	4	17	10	24200


> New Y[]: 
	
	 2  0  4  0  0  1  0  1  0  1  3  0  0  0  0  0  0  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  1  0  0 
 > pw :0,595

## ITERATION 149 #######################


> Neighbours evaluated; 100
> Selected Move:	8945	3	0	8	26000


> New Y[]: 
	
	 0  0  4  0  0  1  0  1  2  1  3  0  0  0  0  0  0  1  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  1 
 > pw :0,6

## ITERATION 150 #######################


> Neighbours evaluated; 92
> Selected Move:	8730	3	7	14	25500


> New Y[]: 
	
	 0  0  4  0  0  1  0  0  2  1  3  0  0  0  1  0  0  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  1 
 > pw :0,605

## ITERATION 151 #######################


> Neighbours evaluated; 96
> Selected Move:	8670	3	17	7	25000


> New Y[]: 
	
	 0  0  4  0  0  1  0  1  2  1  3  0  0  0  1  0  0  0  0  1 


> New S[]: 
	
	 0  0  1  0  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,61

## ITERATION 152 #######################


> Neighbours evaluated; 106
> Selected Move:	8880	3	8	17	24900


> New Y[]: 
	
	 0  0  4  0  0  1  0  1  0  1  3  0  0  0  1  0  0  2  0  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  1 
 > pw :0,615

## ITERATION 153 #######################


> Neighbours evaluated; 99
> Selected Move:	9050	3	10	13	24900


> New Y[]: 
	
	 0  0  4  0  0  1  0  1  0  1  0  0  0  3  1  0  0  2  0  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  1  0  0 
 > pw :0,62

## ITERATION 154 #######################


> Neighbours evaluated; 106
> Selected Move:	8880	3	17	10	25000


> New Y[]: 
	
	 0  0  4  0  0  1  0  1  0  1  2  0  0  3  1  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  1 
 > pw :0,625

## ITERATION 155 #######################


> Neighbours evaluated; 105
> Selected Move:	8857	3	7	17	25500


> New Y[]: 
	
	 0  0  4  0  0  1  0  0  0  1  2  0  0  3  1  0  0  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  1 
 > pw :0,63

## ITERATION 156 #######################


> Neighbours evaluated; 94
> Selected Move:	8820	3	14	7	26000


> New Y[]: 
	
	 0  0  4  0  0  1  0  1  0  1  2  0  0  3  0  0  0  1  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  1 
 > pw :0,635

## ITERATION 157 #######################


> Neighbours evaluated; 90
> Selected Move:	8800	3	13	1	24300


> New Y[]: 
	
	 0  3  4  0  0  1  0  1  0  1  2  0  0  0  0  0  0  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  1  0  0 
 > pw :0,63

## ITERATION 158 #######################


> Neighbours evaluated; 94
> Selected Move:	8800	4	10	17	24700


> New Y[]: 
	
	 0  3  4  0  0  1  0  1  0  1  1  0  0  0  0  0  0  2  0  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  1  0  0 
 > pw :0,625

## ITERATION 159 #######################


> Neighbours evaluated; 90
> Selected Move:	8737	4	17	19	25100


> New Y[]: 
	
	 0  3  4  0  0  1  0  1  0  1  1  0  0  0  0  0  0  1  0  2 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  1  0  0 
 > pw :0,62

## ITERATION 160 #######################


> Neighbours evaluated; 92
> Selected Move:	8798	3	10	18	25600


> New Y[]: 
	
	 0  3  4  0  0  1  0  1  0  1  0  0  0  0  0  0  0  1  1  2 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  1  0  0 
 > pw :0,615

## ITERATION 161 #######################


> Neighbours evaluated; 84
> Selected Move:	8568	3	7	14	25100


> New Y[]: 
	
	 0  3  4  0  0  1  0  0  0  1  0  0  0  0  1  0  0  1  1  2 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  1 
 > pw :0,62

## ITERATION 162 #######################


> Neighbours evaluated; 86
> Selected Move:	8630	4	19	17	24700


> New Y[]: 
	
	 0  3  4  0  0  1  0  0  0  1  0  0  0  0  1  0  0  2  1  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  1 
 > pw :0,625

## ITERATION 163 #######################


> Neighbours evaluated; 88
> Selected Move:	8715	3	9	7	25200


> New Y[]: 
	
	 0  3  4  0  0  1  0  1  0  0  0  0  0  0  1  0  0  2  1  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  1 
 > pw :0,63

## ITERATION 164 #######################


> Neighbours evaluated; 69
> Selected Move:	8840	4	17	18	24900


> New Y[]: 
	
	 0  3  4  0  0  1  0  1  0  0  0  0  0  0  1  0  0  1  2  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  1 
 > pw :0,635

## ITERATION 165 #######################


> Neighbours evaluated; 78
> Selected Move:	8730	3	7	15	24900


> New Y[]: 
	
	 0  3  4  0  0  1  0  0  0  0  0  0  0  0  1  1  0  1  2  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  1 
 > pw :0,64

## ITERATION 166 #######################


> Neighbours evaluated; 83
> Selected Move:	8810	3	14	9	24900


> New Y[]: 
	
	 0  3  4  0  0  1  0  0  0  1  0  0  0  0  0  1  0  1  2  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  1  0  0 
 > pw :0,635

## ITERATION 167 #######################


> Neighbours evaluated; 84
> Selected Move:	8683	4	18	17	25200


> New Y[]: 
	
	 0  3  4  0  0  1  0  0  0  1  0  0  0  0  0  1  0  2  1  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  1  0  0 
 > pw :0,64

## ITERATION 168 #######################


> Neighbours evaluated; 84
> Selected Move:	8670	3	18	16	24700


> New Y[]: 
	
	 0  3  4  0  0  1  0  0  0  1  0  0  0  0  0  1  1  2  0  1 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,645

## ITERATION 169 #######################


> Neighbours evaluated; 84
> Selected Move:	8750	3	17	8	24800


> New Y[]: 
	
	 0  3  4  0  0  1  0  0  2  1  0  0  0  0  0  1  1  0  0  1 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,64

## ITERATION 170 #######################


> Neighbours evaluated; 91
> Selected Move:	8928	3	5	17	25300


> New Y[]: 
	
	 0  3  4  0  0  0  0  0  2  1  0  0  0  0  0  1  1  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  1 
 > pw :0,635

## ITERATION 171 #######################


> Neighbours evaluated; 54
> Selected Move:	8750	3	17	6	24800


> New Y[]: 
	
	 0  3  4  0  0  0  1  0  2  1  0  0  0  0  0  1  1  0  0  1 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,63

## ITERATION 172 #######################


> Neighbours evaluated; 72
> Selected Move:	8750	3	9	14	24800


> New Y[]: 
	
	 0  3  4  0  0  0  1  0  2  0  0  0  0  0  1  1  1  0  0  1 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,625

## ITERATION 173 #######################


> Neighbours evaluated; 58
> Selected Move:	8687	4	8	16	25100


> New Y[]: 
	
	 0  3  4  0  0  0  1  0  1  0  0  0  0  0  1  1  2  0  0  1 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,62

## ITERATION 174 #######################


> Neighbours evaluated; 57
> Selected Move:	8858	3	8	13	25100


> New Y[]: 
	
	 0  3  4  0  0  0  1  0  0  0  0  0  0  1  1  1  2  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  1 
 > pw :0,615

## ITERATION 175 #######################


> Neighbours evaluated; 56
> Selected Move:	8858	3	14	9	25100


> New Y[]: 
	
	 0  3  4  0  0  0  1  0  0  1  0  0  0  1  0  1  2  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  1 
 > pw :0,62

## ITERATION 176 #######################


> Neighbours evaluated; 76
> Selected Move:	8708	3	6	17	25600


> New Y[]: 
	
	 0  3  4  0  0  0  0  0  0  1  0  0  0  1  0  1  2  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  1 
 > pw :0,625

## ITERATION 177 #######################


> Neighbours evaluated; 60
> Selected Move:	8745	3	13	8	25600


> New Y[]: 
	
	 0  3  4  0  0  0  0  0  1  1  0  0  0  0  0  1  2  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  1 
 > pw :0,63

## ITERATION 178 #######################


> Neighbours evaluated; 58
> Selected Move:	8722	3	9	14	25600


> New Y[]: 
	
	 0  3  4  0  0  0  0  0  1  0  0  0  0  0  1  1  2  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  1 
 > pw :0,635

## ITERATION 179 #######################


> Neighbours evaluated; 49
> Selected Move:	8829	3	15	7	25600


> New Y[]: 
	
	 0  3  4  0  0  0  0  1  1  0  0  0  0  0  1  0  2  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  1 
 > pw :0,64

## ITERATION 180 #######################


> Neighbours evaluated; 46
> Selected Move:	8506	3	19	3	26100


> New Y[]: 
	
	 0  3  4  1  0  0  0  1  1  0  0  0  0  0  1  0  2  1  0  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0 
 > pw :0,645

## ITERATION 181 #######################


> Neighbours evaluated; 34
> Selected Move:	8910	3	8	6	24600


> New Y[]: 
	
	 0  3  4  1  0  0  1  1  0  0  0  0  0  0  1  0  2  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  1  0  0  0 
 > pw :0,65

## ITERATION 182 #######################


> Neighbours evaluated; 48
> Selected Move:	8910	3	7	9	24100


> New Y[]: 
	
	 0  3  4  1  0  0  1  0  0  1  0  0  0  0  1  0  2  1  0  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0 
 > pw :0,655

## ITERATION 183 #######################


> Neighbours evaluated; 75
> Selected Move:	8910	4	16	3	25000


> New Y[]: 
	
	 0  3  4  2  0  0  1  0  0  1  0  0  0  0  1  0  1  1  0  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0 
 > pw :0,66

## ITERATION 184 #######################


> Neighbours evaluated; 61
> Selected Move:	8910	4	3	17	24700


> New Y[]: 
	
	 0  3  4  1  0  0  1  0  0  1  0  0  0  0  1  0  1  2  0  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0 
 > pw :0,665

## ITERATION 185 #######################


> Neighbours evaluated; 73
> Selected Move:	8910	3	17	8	24800


> New Y[]: 
	
	 0  3  4  1  0  0  1  0  2  1  0  0  0  0  1  0  1  0  0  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,67

## ITERATION 186 #######################


> Neighbours evaluated; 65
> Selected Move:	8843	4	8	16	25100


> New Y[]: 
	
	 0  3  4  1  0  0  1  0  1  1  0  0  0  0  1  0  2  0  0  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,675

## ITERATION 187 #######################


> Neighbours evaluated; 56
> Selected Move:	8932	3	6	5	25100


> New Y[]: 
	
	 0  3  4  1  0  1  0  0  1  1  0  0  0  0  1  0  2  0  0  0 


> New S[]: 
	
	 0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,68

## ITERATION 188 #######################


> Neighbours evaluated; 84
> Selected Move:	8864	3	16	17	25200


> New Y[]: 
	
	 0  3  4  1  0  1  0  0  1  1  0  0  0  0  1  0  0  2  0  0 


> New S[]: 
	
	 0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,685

## ITERATION 189 #######################


> Neighbours evaluated; 80
> Selected Move:	8883	3	8	13	25200


> New Y[]: 
	
	 0  3  4  1  0  1  0  0  0  1  0  0  0  1  1  0  0  2  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  1  0  0 
 > pw :0,69

## ITERATION 190 #######################


> Neighbours evaluated; 86
> Selected Move:	8797	3	14	7	25700


> New Y[]: 
	
	 0  3  4  1  0  1  0  1  0  1  0  0  0  1  0  0  0  2  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  1  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,695

## ITERATION 191 #######################


> Neighbours evaluated; 78
> Selected Move:	8811	3	13	16	25200


> New Y[]: 
	
	 0  3  4  1  0  1  0  1  0  1  0  0  0  0  0  0  1  2  0  0 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,7

## ITERATION 192 #######################


> Neighbours evaluated; 82
> Selected Move:	8820	3	17	8	25300


> New Y[]: 
	
	 0  3  4  1  0  1  0  1  2  1  0  0  0  0  0  0  1  0  0  0 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,705

## ITERATION 193 #######################


> Neighbours evaluated; 77
> Selected Move:	8818	3	9	14	25300


> New Y[]: 
	
	 0  3  4  1  0  1  0  1  2  0  0  0  0  0  1  0  1  0  0  0 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,71

## ITERATION 194 #######################


> Neighbours evaluated; 77
> Selected Move:	8808	3	8	17	25200


> New Y[]: 
	
	 0  3  4  1  0  1  0  1  0  0  0  0  0  0  1  0  1  2  0  0 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,715

## ITERATION 195 #######################


> Neighbours evaluated; 72
> Selected Move:	8767	3	5	6	25200


> New Y[]: 
	
	 0  3  4  1  0  0  1  1  0  0  0  0  0  0  1  0  1  2  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  1  0  0  0 
 > pw :0,72

## ITERATION 196 #######################


> Neighbours evaluated; 42
> Selected Move:	8766	3	14	9	25200


> New Y[]: 
	
	 0  3  4  1  0  0  1  1  0  1  0  0  0  0  0  0  1  2  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  1  0  0  0 
 > pw :0,725

## ITERATION 197 #######################


> Neighbours evaluated; 44
> Selected Move:	8910	4	17	16	24600


> New Y[]: 
	
	 0  3  4  1  0  0  1  1  0  1  0  0  0  0  0  0  2  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  1  0  0  0 
 > pw :0,73

## ITERATION 198 #######################


> Neighbours evaluated; 76
> Selected Move:	8682	3	17	13	25600


> New Y[]: 
	
	 0  3  4  1  0  0  1  1  0  1  0  0  0  1  0  0  2  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  1  0  0  0 
 > pw :0,735

## ITERATION 199 #######################


> Neighbours evaluated; 44
> Selected Move:	8836	3	7	14	25100


> New Y[]: 
	
	 0  3  4  1  0  0  1  0  0  1  0  0  0  1  1  0  2  0  0  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0 
 > pw :0,74

## ITERATION 200 #######################


> Neighbours evaluated; 67
> Selected Move:	8676	3	3	4	25100


> New Y[]: 
	
	 0  3  4  0  1  0  1  0  0  1  0  0  0  1  1  0  2  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  1  0  0  0 
 > pw :0,745

## ITERATION 201 #######################


> Neighbours evaluated; 61
> Selected Move:	8675	3	6	5	25100


> New Y[]: 
	
	 0  3  4  0  1  1  0  0  0  1  0  0  0  1  1  0  2  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  1  0  0  0 
 > pw :0,75

## ITERATION 202 #######################


> Neighbours evaluated; 82
> Selected Move:	8895	3	4	17	25100


> New Y[]: 
	
	 0  3  4  0  0  1  0  0  0  1  0  0  0  1  1  0  2  1  0  0 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,755

## ITERATION 203 #######################


> Neighbours evaluated; 92
> Selected Move:	8750	3	13	4	24100


> New Y[]: 
	
	 0  3  4  0  1  1  0  0  0  1  0  0  0  0  1  0  2  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  1  0  0 
 > pw :0,76

## ITERATION 204 #######################


> Neighbours evaluated; 85
> Selected Move:	8770	3	9	7	24600


> New Y[]: 
	
	 0  3  4  0  1  1  0  1  0  0  0  0  0  0  1  0  2  1  0  0 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,765

## ITERATION 205 #######################


> Neighbours evaluated; 73
> Selected Move:	8960	3	16	8	24800


> New Y[]: 
	
	 0  3  4  0  1  1  0  1  2  0  0  0  0  0  1  0  0  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,77

## ITERATION 206 #######################


> Neighbours evaluated; 78
> Selected Move:	8980	3	14	9	24800


> New Y[]: 
	
	 0  3  4  0  1  1  0  1  2  1  0  0  0  0  0  0  0  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  1  0  0 
 > pw :0,775

## ITERATION 207 #######################


> Neighbours evaluated; 80
> Selected Move:	8770	3	8	16	24600


> New Y[]: 
	
	 0  3  4  0  1  1  0  1  0  1  0  0  0  0  0  0  2  1  0  0 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,78

## ITERATION 208 #######################


> Neighbours evaluated; 79
> Selected Move:	8698	3	16	13	25400


> New Y[]: 
	
	 0  3  4  0  1  1  0  1  0  1  0  0  0  2  0  0  0  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  1  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,785

## ITERATION 209 #######################


> Neighbours evaluated; 74
> Selected Move:	8750	3	7	14	24900


> New Y[]: 
	
	 0  3  4  0  1  1  0  0  0  1  0  0  0  2  1  0  0  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  1  0  0 
 > pw :0,78

## ITERATION 210 #######################


> Neighbours evaluated; 83
> Selected Move:	8750	3	13	8	24300


> New Y[]: 
	
	 0  3  4  0  1  1  0  0  2  1  0  0  0  0  1  0  0  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,775

## ITERATION 211 #######################


> Neighbours evaluated; 86
> Selected Move:	8750	3	17	16	24800


> New Y[]: 
	
	 0  3  4  0  1  1  0  0  2  1  0  0  0  0  1  0  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  1  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,77

## ITERATION 212 #######################


> Neighbours evaluated; 83
> Selected Move:	8750	3	8	17	24700


> New Y[]: 
	
	 0  3  4  0  1  1  0  0  0  1  0  0  0  0  1  0  1  2  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  1  0  0 
 > pw :0,765

## ITERATION 213 #######################


> Neighbours evaluated; 77
> Selected Move:	8750	4	17	4	24600


> New Y[]: 
	
	 0  3  4  0  2  1  0  0  0  1  0  0  0  0  1  0  1  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  1  0  0 
 > pw :0,76

## ITERATION 214 #######################


> Neighbours evaluated; 83
> Selected Move:	8694	3	9	7	25100


> New Y[]: 
	
	 0  3  4  0  2  1  0  1  0  0  0  0  0  0  1  0  1  1  0  0 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,755

## ITERATION 215 #######################


> Neighbours evaluated; 68
> Selected Move:	8694	3	14	9	25100


> New Y[]: 
	
	 0  3  4  0  2  1  0  1  0  1  0  0  0  0  0  0  1  1  0  0 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,75

## ITERATION 216 #######################


> Neighbours evaluated; 79
> Selected Move:	8620	4	4	17	25200


> New Y[]: 
	
	 0  3  4  0  1  1  0  1  0  1  0  0  0  0  0  0  1  2  0  0 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,745

## ITERATION 217 #######################


> Neighbours evaluated; 82
> Selected Move:	8626	3	17	8	25300


> New Y[]: 
	
	 0  3  4  0  1  1  0  1  2  1  0  0  0  0  0  0  1  0  0  0 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,75

## ITERATION 218 #######################


> Neighbours evaluated; 78
> Selected Move:	8625	3	9	14	25300


> New Y[]: 
	
	 0  3  4  0  1  1  0  1  2  0  0  0  0  0  1  0  1  0  0  0 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,755

## ITERATION 219 #######################


> Neighbours evaluated; 77
> Selected Move:	8619	3	8	17	25200


> New Y[]: 
	
	 0  3  4  0  1  1  0  1  0  0  0  0  0  0  1  0  1  2  0  0 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,76

## ITERATION 220 #######################


> Neighbours evaluated; 73
> Selected Move:	8488	3	5	6	25200


> New Y[]: 
	
	 0  3  4  0  1  0  1  1  0  0  0  0  0  0  1  0  1  2  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  1  0  0  0 
 > pw :0,765

## ITERATION 221 #######################


> Neighbours evaluated; 38
> Selected Move:	8640	4	17	16	24600


> New Y[]: 
	
	 0  3  4  0  1  0  1  1  0  0  0  0  0  0  1  0  2  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  1  0  0  0 
 > pw :0,77

## ITERATION 222 #######################


> Neighbours evaluated; 47
> Selected Move:	8640	3	7	9	24100


> New Y[]: 
	
	 0  3  4  0  1  0  1  0  0  1  0  0  0  0  1  0  2  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  1  0  0  0 
 > pw :0,775

## ITERATION 223 #######################


> Neighbours evaluated; 74
> Selected Move:	8640	4	16	4	24600


> New Y[]: 
	
	 0  3  4  0  2  0  1  0  0  1  0  0  0  0  1  0  1  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  1  0  0  0 
 > pw :0,78

## ITERATION 224 #######################


> Neighbours evaluated; 57
> Selected Move:	8910	3	4	19	24600


> New Y[]: 
	
	 0  3  4  0  0  0  1  0  0  1  0  0  0  0  1  0  1  1  0  2 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  1 
 > pw :0,785

## ITERATION 225 #######################


> Neighbours evaluated; 57
> Selected Move:	8861	3	9	7	25100


> New Y[]: 
	
	 0  3  4  0  0  0  1  1  0  0  0  0  0  0  1  0  1  1  0  2 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,79

## ITERATION 226 #######################


> Neighbours evaluated; 39
> Selected Move:	8861	3	14	9	25100


> New Y[]: 
	
	 0  3  4  0  0  0  1  1  0  1  0  0  0  0  0  0  1  1  0  2 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,795

## ITERATION 227 #######################


> Neighbours evaluated; 66
> Selected Move:	8590	3	7	15	25100


> New Y[]: 
	
	 0  3  4  0  0  0  1  0  0  1  0  0  0  0  0  1  1  1  0  2 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,8

## ITERATION 228 #######################


> Neighbours evaluated; 58
> Selected Move:	8670	4	19	16	24100


> New Y[]: 
	
	 0  3  4  0  0  0  1  0  0  1  0  0  0  0  0  1  2  1  0  1 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,805

## ITERATION 229 #######################


> Neighbours evaluated; 68
> Selected Move:	8680	3	19	3	24600


> New Y[]: 
	
	 0  3  4  1  0  0  1  0  0  1  0  0  0  0  0  1  2  1  0  0 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,8

## ITERATION 230 #######################


> Neighbours evaluated; 73
> Selected Move:	8680	3	6	5	24600


> New Y[]: 
	
	 0  3  4  1  0  1  0  0  0  1  0  0  0  0  0  1  2  1  0  0 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,795

## ITERATION 231 #######################


> Neighbours evaluated; 89
> Selected Move:	8890	3	16	8	24800


> New Y[]: 
	
	 0  3  4  1  0  1  0  0  2  1  0  0  0  0  0  1  0  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  1  0  0 
 > pw :0,79

## ITERATION 232 #######################


> Neighbours evaluated; 89
> Selected Move:	8890	3	9	14	24800


> New Y[]: 
	
	 0  3  4  1  0  1  0  0  2  0  0  0  0  0  1  1  0  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  1  0  0 
 > pw :0,785

## ITERATION 233 #######################


> Neighbours evaluated; 78
> Selected Move:	8716	3	8	13	25400


> New Y[]: 
	
	 0  3  4  1  0  1  0  0  0  0  0  0  0  2  1  1  0  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  1  0  0 
 > pw :0,78

## ITERATION 234 #######################


> Neighbours evaluated; 66
> Selected Move:	8718	3	14	9	25400


> New Y[]: 
	
	 0  3  4  1  0  1  0  0  0  1  0  0  0  2  0  1  0  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  1  0  0 
 > pw :0,785

## ITERATION 235 #######################


> Neighbours evaluated; 92
> Selected Move:	8480	4	13	17	25700


> New Y[]: 
	
	 0  3  4  1  0  1  0  0  0  1  0  0  0  1  0  1  0  2  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  1  0  0 
 > pw :0,79

## ITERATION 236 #######################


> Neighbours evaluated; 89
> Selected Move:	8556	3	17	16	25600


> New Y[]: 
	
	 0  3  4  1  0  1  0  0  0  1  0  0  0  1  0  1  2  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  1  0  0  0 
 > pw :0,795

## ITERATION 237 #######################


> Neighbours evaluated; 88
> Selected Move:	8553	3	9	14	25600


> New Y[]: 
	
	 0  3  4  1  0  1  0  0  0  0  0  0  0  1  1  1  2  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0  1  0  0  0 
 > pw :0,8

## ITERATION 238 #######################


> Neighbours evaluated; 66
> Selected Move:	8750	3	15	7	25600


> New Y[]: 
	
	 0  3  4  1  0  1  0  1  0  0  0  0  0  1  1  0  2  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  1  0  0  0 
 > pw :0,805

## ITERATION 239 #######################


> Neighbours evaluated; 68
> Selected Move:	8666	3	16	17	25700


> New Y[]: 
	
	 0  3  4  1  0  1  0  1  0  0  0  0  0  1  1  0  0  2  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  1  0  0 
 > pw :0,81

## ITERATION 240 #######################


> Neighbours evaluated; 67
> Selected Move:	8643	3	13	8	25700


> New Y[]: 
	
	 0  3  4  1  0  1  0  1  1  0  0  0  0  0  1  0  0  2  0  0 


> New S[]: 
	
	 0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,815

## ITERATION 241 #######################


> Neighbours evaluated; 73
> Selected Move:	8679	3	14	9	25700


> New Y[]: 
	
	 0  3  4  1  0  1  0  1  1  1  0  0  0  0  0  0  0  2  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  1  0  0 
 > pw :0,82

## ITERATION 242 #######################


> Neighbours evaluated; 71
> Selected Move:	8538	3	17	16	25600


> New Y[]: 
	
	 0  3  4  1  0  1  0  1  1  1  0  0  0  0  0  0  2  0  0  0 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,825

## ITERATION 243 #######################


> Neighbours evaluated; 78
> Selected Move:	8535	3	9	14	25600


> New Y[]: 
	
	 0  3  4  1  0  1  0  1  1  0  0  0  0  0  1  0  2  0  0  0 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,83

## ITERATION 244 #######################


> Neighbours evaluated; 80
> Selected Move:	8482	3	5	6	25600


> New Y[]: 
	
	 0  3  4  1  0  0  1  1  1  0  0  0  0  0  1  0  2  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  1  0  0  0 
 > pw :0,835

## ITERATION 245 #######################


> Neighbours evaluated; 26
> Selected Move:	8729	4	16	8	25300


> New Y[]: 
	
	 0  3  4  1  0  0  1  1  2  0  0  0  0  0  1  0  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  1  0  0  0 
 > pw :0,84

## ITERATION 246 #######################


> Neighbours evaluated; 55
> Selected Move:	8728	3	14	9	25300


> New Y[]: 
	
	 0  3  4  1  0  0  1  1  2  1  0  0  0  0  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  1  0  0  0 
 > pw :0,845

## ITERATION 247 #######################


> Neighbours evaluated; 42
> Selected Move:	8630	3	16	17	24800


> New Y[]: 
	
	 0  3  4  1  0  0  1  1  2  1  0  0  0  0  0  0  0  1  0  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,85

## ITERATION 248 #######################


> Neighbours evaluated; 62
> Selected Move:	8630	3	3	19	24300


> New Y[]: 
	
	 0  3  4  0  0  0  1  1  2  1  0  0  0  0  0  0  0  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  1 
 > pw :0,855

## ITERATION 249 #######################


> Neighbours evaluated; 89
> Selected Move:	8630	3	7	14	23800


> New Y[]: 
	
	 0  3  4  0  0  0  1  0  2  1  0  0  0  0  1  0  0  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  1 
 > pw :0,86

## ITERATION 250 #######################


> Neighbours evaluated; 85
> Selected Move:	8630	4	8	17	24700


> New Y[]: 
	
	 0  3  4  0  0  0  1  0  1  1  0  0  0  0  1  0  0  2  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  1 
 > pw :0,865

## ITERATION 251 #######################


> Neighbours evaluated; 66
> Selected Move:	8590	3	8	13	24700


> New Y[]: 
	
	 0  3  4  0  0  0  1  0  0  1  0  0  0  1  1  0  0  2  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  1 
 > pw :0,87

## ITERATION 252 #######################


> Neighbours evaluated; 76
> Selected Move:	8590	4	17	13	24400


> New Y[]: 
	
	 0  3  4  0  0  0  1  0  0  1  0  0  0  2  1  0  0  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  1 
 > pw :0,865

## ITERATION 253 #######################


> Neighbours evaluated; 77
> Selected Move:	8794	3	6	16	25400


> New Y[]: 
	
	 0  3  4  0  0  0  0  0  0  1  0  0  0  2  1  0  1  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  1 
 > pw :0,86

## ITERATION 254 #######################


> Neighbours evaluated; 49
> Selected Move:	8712	3	13	5	25300


> New Y[]: 
	
	 0  3  4  0  0  2  0  0  0  1  0  0  0  0  1  0  1  1  0  1 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,855

## ITERATION 255 #######################


> Neighbours evaluated; 87
> Selected Move:	8640	3	5	12	25000


> New Y[]: 
	
	 0  3  4  0  0  0  0  0  0  1  0  0  2  0  1  0  1  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  1  0  0  0 
 > pw :0,85

## ITERATION 256 #######################


> Neighbours evaluated; 66
> Selected Move:	8560	3	12	4	24600


> New Y[]: 
	
	 0  3  4  0  2  0  0  0  0  1  0  0  0  0  1  0  1  1  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0 
 > pw :0,845

## ITERATION 257 #######################


> Neighbours evaluated; 62
> Selected Move:	8560	4	4	16	24100


> New Y[]: 
	
	 0  3  4  0  1  0  0  0  0  1  0  0  0  0  1  0  2  1  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0 
 > pw :0,84

## ITERATION 258 #######################


> Neighbours evaluated; 58
> Selected Move:	8812	3	2	13	25700


> New Y[]: 
	
	 0  3  0  0  1  0  0  0  0  1  0  0  0  4  1  0  2  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  1  0  0  0 
 > pw :0,835

## ITERATION 259 #######################


> Neighbours evaluated; 59
> Selected Move:	9283	3	17	5	25200


> New Y[]: 
	
	 0  3  0  0  1  1  0  0  0  1  0  0  0  4  1  0  2  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  1 
 > pw :0,83

## ITERATION 260 #######################


> Neighbours evaluated; 93
> Selected Move:	9170	3	4	11	24200


> New Y[]: 
	
	 0  3  0  0  0  1  0  0  0  1  0  1  0  4  1  0  2  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  1 
 > pw :0,825

## ITERATION 261 #######################


> Neighbours evaluated; 89
> Selected Move:	9650	3	14	7	24700


> New Y[]: 
	
	 0  3  0  0  0  1  0  1  0  1  0  1  0  4  0  0  2  0  0  1    >new incumb.: 9650


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0 
 > pw :0,82

## ITERATION 262 #######################


> Neighbours evaluated; 82
> Selected Move:	9780	3	16	17	24800


> New Y[]: 
	
	 0  3  0  0  0  1  0  1  0  1  0  1  0  4  0  0  0  2  0  1    >new incumb.: 9780


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  1 
 > pw :0,815

## ITERATION 263 #######################


> Neighbours evaluated; 74
> Selected Move:	9620	3	13	8	24800


> New Y[]: 
	
	 0  3  0  0  0  1  0  1  4  1  0  1  0  0  0  0  0  2  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0 
 > pw :0,81

## ITERATION 264 #######################


> Neighbours evaluated; 77
> Selected Move:	9458	4	17	19	25200


> New Y[]: 
	
	 0  3  0  0  0  1  0  1  4  1  0  1  0  0  0  0  0  1  0  2 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0 
 > pw :0,805

## ITERATION 265 #######################


> Neighbours evaluated; 71
> Selected Move:	9619	3	8	13	25200


> New Y[]: 
	
	 0  3  0  0  0  1  0  1  0  1  0  1  0  4  0  0  0  1  0  2 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  1 
 > pw :0,8

## ITERATION 266 #######################


> Neighbours evaluated; 78
> Selected Move:	9300	3	9	14	25200


> New Y[]: 
	
	 0  3  0  0  0  1  0  1  0  0  0  1  0  4  1  0  0  1  0  2 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  1 
 > pw :0,805

## ITERATION 267 #######################


> Neighbours evaluated; 59
> Selected Move:	9460	4	19	17	24800


> New Y[]: 
	
	 0  3  0  0  0  1  0  1  0  0  0  1  0  4  1  0  0  2  0  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  1 
 > pw :0,81

## ITERATION 268 #######################


> Neighbours evaluated; 74
> Selected Move:	9460	3	17	16	24700


> New Y[]: 
	
	 0  3  0  0  0  1  0  1  0  0  0  1  0  4  1  0  2  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  1 
 > pw :0,805

## ITERATION 269 #######################


> Neighbours evaluated; 74
> Selected Move:	9350	3	7	15	24700


> New Y[]: 
	
	 0  3  0  0  0  1  0  0  0  0  0  1  0  4  1  1  2  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  1 
 > pw :0,8

## ITERATION 270 #######################


> Neighbours evaluated; 77
> Selected Move:	9370	3	14	9	24700


> New Y[]: 
	
	 0  3  0  0  0  1  0  0  0  1  0  1  0  4  0  1  2  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0 
 > pw :0,795

## ITERATION 271 #######################


> Neighbours evaluated; 86
> Selected Move:	9410	3	16	17	24800


> New Y[]: 
	
	 0  3  0  0  0  1  0  0  0  1  0  1  0  4  0  1  0  2  0  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  1 
 > pw :0,79

## ITERATION 272 #######################


> Neighbours evaluated; 84
> Selected Move:	9350	3	9	14	24800


> New Y[]: 
	
	 0  3  0  0  0  1  0  0  0  0  0  1  0  4  1  1  0  2  0  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  1 
 > pw :0,785

## ITERATION 273 #######################


> Neighbours evaluated; 74
> Selected Move:	9210	3	13	8	24800


> New Y[]: 
	
	 0  3  0  0  0  1  0  0  4  0  0  1  0  0  1  1  0  2  0  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  1 
 > pw :0,78

## ITERATION 274 #######################


> Neighbours evaluated; 68
> Selected Move:	9320	3	15	7	24800


> New Y[]: 
	
	 0  3  0  0  0  1  0  1  4  0  0  1  0  0  1  0  0  2  0  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  1 
 > pw :0,775

## ITERATION 275 #######################


> Neighbours evaluated; 72
> Selected Move:	9165	4	17	19	25200


> New Y[]: 
	
	 0  3  0  0  0  1  0  1  4  0  0  1  0  0  1  0  0  1  0  2 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  1 
 > pw :0,77

## ITERATION 276 #######################


> Neighbours evaluated; 71
> Selected Move:	9056	3	7	15	25200


> New Y[]: 
	
	 0  3  0  0  0  1  0  0  4  0  0  1  0  0  1  1  0  1  0  2 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  1 
 > pw :0,765

## ITERATION 277 #######################


> Neighbours evaluated; 66
> Selected Move:	9197	3	8	13	25200


> New Y[]: 
	
	 0  3  0  0  0  1  0  0  0  0  0  1  0  4  1  1  0  1  0  2 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  1 
 > pw :0,76

## ITERATION 278 #######################


> Neighbours evaluated; 72
> Selected Move:	9258	3	14	9	25200


> New Y[]: 
	
	 0  3  0  0  0  1  0  0  0  1  0  1  0  4  0  1  0  1  0  2 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  1 
 > pw :0,755

## ITERATION 279 #######################


> Neighbours evaluated; 85
> Selected Move:	9170	3	15	14	24700


> New Y[]: 
	
	 0  3  0  0  0  1  0  0  0  1  0  1  0  4  1  0  0  1  0  2 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  1 
 > pw :0,75

## ITERATION 280 #######################


> Neighbours evaluated; 87
> Selected Move:	9170	4	19	17	24300


> New Y[]: 
	
	 0  3  0  0  0  1  0  0  0  1  0  1  0  4  1  0  0  2  0  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  1 
 > pw :0,745

## ITERATION 281 #######################


> Neighbours evaluated; 90
> Selected Move:	9280	3	11	7	24800


> New Y[]: 
	
	 0  3  0  0  0  1  0  1  0  1  0  0  0  4  1  0  0  2  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  1 
 > pw :0,74

## ITERATION 282 #######################


> Neighbours evaluated; 89
> Selected Move:	9178	3	7	4	25300


> New Y[]: 
	
	 0  3  0  0  1  1  0  0  0  1  0  0  0  4  1  0  0  2  0  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  1  0  0  0  0  1  0  0  0  0  0 
 > pw :0,745

## ITERATION 283 #######################


> Neighbours evaluated; 89
> Selected Move:	9251	4	17	4	25200


> New Y[]: 
	
	 0  3  0  0  2  1  0  0  0  1  0  0  0  4  1  0  0  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  1  0  0  0  0  1  0  0  0  0  0 
 > pw :0,75

## ITERATION 284 #######################


> Neighbours evaluated; 97
> Selected Move:	9130	3	19	7	25200


> New Y[]: 
	
	 0  3  0  0  2  1  0  1  0  1  0  0  0  4  1  0  0  1  0  0 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,755

## ITERATION 285 #######################


> Neighbours evaluated; 84
> Selected Move:	9239	3	14	11	25200


> New Y[]: 
	
	 0  3  0  0  2  1  0  1  0  1  0  1  0  4  0  0  0  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  1  0  0 
 > pw :0,76

## ITERATION 286 #######################


> Neighbours evaluated; 72
> Selected Move:	9238	3	13	8	25200


> New Y[]: 
	
	 0  3  0  0  2  1  0  1  4  1  0  1  0  0  0  0  0  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,765

## ITERATION 287 #######################


> Neighbours evaluated; 76
> Selected Move:	9161	3	4	3	25600


> New Y[]: 
	
	 0  3  0  2  0  1  0  1  4  1  0  1  0  0  0  0  0  1  0  0 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,77

## ITERATION 288 #######################


> Neighbours evaluated; 72
> Selected Move:	9389	4	3	17	25300


> New Y[]: 
	
	 0  3  0  1  0  1  0  1  4  1  0  1  0  0  0  0  0  2  0  0 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,775

## ITERATION 289 #######################


> Neighbours evaluated; 79
> Selected Move:	9427	3	8	13	25300


> New Y[]: 
	
	 0  3  0  1  0  1  0  1  0  1  0  1  0  4  0  0  0  2  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  1  0  0 
 > pw :0,78

## ITERATION 290 #######################


> Neighbours evaluated; 79
> Selected Move:	9504	3	17	16	25200


> New Y[]: 
	
	 0  3  0  1  0  1  0  1  0  1  0  1  0  4  0  0  2  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0 
 > pw :0,785

## ITERATION 291 #######################


> Neighbours evaluated; 81
> Selected Move:	9273	3	5	6	25200


> New Y[]: 
	
	 0  3  0  1  0  0  1  1  0  1  0  1  0  4  0  0  2  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0 
 > pw :0,79

## ITERATION 292 #######################


> Neighbours evaluated; 55
> Selected Move:	9550	3	3	19	24700


> New Y[]: 
	
	 0  3  0  0  0  0  1  1  0  1  0  1  0  4  0  0  2  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  1 
 > pw :0,795

## ITERATION 293 #######################


> Neighbours evaluated; 39
> Selected Move:	9621	3	6	17	25200


> New Y[]: 
	
	 0  3  0  0  0  0  0  1  0  1  0  1  0  4  0  0  2  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  1 
 > pw :0,8

## ITERATION 294 #######################


> Neighbours evaluated; 39
> Selected Move:	9480	3	13	8	25200


> New Y[]: 
	
	 0  3  0  0  0  0  0  1  4  1  0  1  0  0  0  0  2  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  1 
 > pw :0,805

## ITERATION 295 #######################


> Neighbours evaluated; 48
> Selected Move:	9159	3	9	14	25200


> New Y[]: 
	
	 0  3  0  0  0  0  0  1  4  0  0  1  0  0  1  0  2  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  1 
 > pw :0,81

## ITERATION 296 #######################


> Neighbours evaluated; 32
> Selected Move:	9298	3	8	13	25200


> New Y[]: 
	
	 0  3  0  0  0  0  0  1  0  0  0  1  0  4  1  0  2  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  1 
 > pw :0,815

## ITERATION 297 #######################


> Neighbours evaluated; 45
> Selected Move:	9230	3	17	6	24700


> New Y[]: 
	
	 0  3  0  0  0  0  1  1  0  0  0  1  0  4  1  0  2  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  1 
 > pw :0,82

## ITERATION 298 #######################


> Neighbours evaluated; 58
> Selected Move:	9120	3	7	15	24700


> New Y[]: 
	
	 0  3  0  0  0  0  1  0  0  0  0  1  0  4  1  1  2  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  1 
 > pw :0,825

## ITERATION 299 #######################


> Neighbours evaluated; 59
> Selected Move:	9185	3	6	17	25200


> New Y[]: 
	
	 0  3  0  0  0  0  0  0  0  0  0  1  0  4  1  1  2  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  1 
 > pw :0,83

## ITERATION 300 #######################


> Neighbours evaluated; 41
> Selected Move:	9244	3	14	9	25200


> New Y[]: 
	
	 0  3  0  0  0  0  0  0  0  1  0  1  0  4  0  1  2  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  1 
 > pw :0,835

## ITERATION 301 #######################


> Neighbours evaluated; 45
> Selected Move:	9180	3	17	6	24700


> New Y[]: 
	
	 0  3  0  0  0  0  1  0  0  1  0  1  0  4  0  1  2  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  1 
 > pw :0,84

## ITERATION 302 #######################


> Neighbours evaluated; 79
> Selected Move:	8940	3	15	14	24200


> New Y[]: 
	
	 0  3  0  0  0  0  1  0  0  1  0  1  0  4  1  0  2  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  1 
 > pw :0,845

## ITERATION 303 #######################


> Neighbours evaluated; 69
> Selected Move:	9170	3	6	17	24700


> New Y[]: 
	
	 0  3  0  0  0  0  0  0  0  1  0  1  0  4  1  0  2  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  1 
 > pw :0,85

## ITERATION 304 #######################


> Neighbours evaluated; 45
> Selected Move:	9200	3	11	7	25200


> New Y[]: 
	
	 0  3  0  0  0  0  0  1  0  1  0  0  0  4  1  0  2  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  1 
 > pw :0,855

## ITERATION 305 #######################


> Neighbours evaluated; 55
> Selected Move:	8969	3	7	15	25200


> New Y[]: 
	
	 0  3  0  0  0  0  0  0  0  1  0  0  0  4  1  1  2  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  1 
 > pw :0,86

## ITERATION 306 #######################


> Neighbours evaluated; 50
> Selected Move:	8798	3	15	5	25200


> New Y[]: 
	
	 0  3  0  0  0  1  0  0  0  1  0  0  0  4  1  0  2  1  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  1 
 > pw :0,865

## ITERATION 307 #######################


> Neighbours evaluated; 84
> Selected Move:	9007	3	17	3	25200


> New Y[]: 
	
	 0  3  0  1  0  1  0  0  0  1  0  0  0  4  1  0  2  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0 
 > pw :0,87

## ITERATION 308 #######################


> Neighbours evaluated; 100
> Selected Move:	9050	3	19	11	24700


> New Y[]: 
	
	 0  3  0  1  0  1  0  0  0  1  0  1  0  4  1  0  2  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  1  0  0  0 
 > pw :0,875

## ITERATION 309 #######################


> Neighbours evaluated; 90
> Selected Move:	9165	3	9	7	25200


> New Y[]: 
	
	 0  3  0  1  0  1  0  1  0  0  0  1  0  4  1  0  2  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  1  0  0  0 
 > pw :0,88

## ITERATION 310 #######################


> Neighbours evaluated; 75
> Selected Move:	9076	3	16	17	25300


> New Y[]: 
	
	 0  3  0  1  0  1  0  1  0  0  0  1  0  4  1  0  0  2  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  1  0  0 
 > pw :0,885

## ITERATION 311 #######################


> Neighbours evaluated; 72
> Selected Move:	9054	3	13	8	25300


> New Y[]: 
	
	 0  3  0  1  0  1  0  1  4  0  0  1  0  0  1  0  0  2  0  0 


> New S[]: 
	
	 0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,89

## ITERATION 312 #######################


> Neighbours evaluated; 76
> Selected Move:	9030	3	7	9	24800


> New Y[]: 
	
	 0  3  0  1  0  1  0  0  4  1  0  1  0  0  1  0  0  2  0  0 


> New S[]: 
	
	 0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,895

## ITERATION 313 #######################


> Neighbours evaluated; 90
> Selected Move:	9050	3	8	13	24800


> New Y[]: 
	
	 0  3  0  1  0  1  0  0  0  1  0  1  0  4  1  0  0  2  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  1  0  0 
 > pw :0,9

## ITERATION 314 #######################


> Neighbours evaluated; 84
> Selected Move:	9020	3	14	15	25300


> New Y[]: 
	
	 0  3  0  1  0  1  0  0  0  1  0  1  0  4  0  1  0  2  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  1  0  0 
 > pw :0,905

## ITERATION 315 #######################


> Neighbours evaluated; 84
> Selected Move:	9109	3	17	16	25200


> New Y[]: 
	
	 0  3  0  1  0  1  0  0  0  1  0  1  0  4  0  1  2  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  1  0  0  0 
 > pw :0,91

## ITERATION 316 #######################


> Neighbours evaluated; 85
> Selected Move:	9048	3	9	14	25200


> New Y[]: 
	
	 0  3  0  1  0  1  0  0  0  0  0  1  0  4  1  1  2  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  1  0  0  0 
 > pw :0,915

## ITERATION 317 #######################


> Neighbours evaluated; 74
> Selected Move:	8955	3	16	17	25300


> New Y[]: 
	
	 0  3  0  1  0  1  0  0  0  0  0  1  0  4  1  1  0  2  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  1  0  0 
 > pw :0,92

## ITERATION 318 #######################


> Neighbours evaluated; 68
> Selected Move:	8934	3	13	8	25300


> New Y[]: 
	
	 0  3  0  1  0  1  0  0  4  0  0  1  0  0  1  1  0  2  0  0 


> New S[]: 
	
	 0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,925

## ITERATION 319 #######################


> Neighbours evaluated; 65
> Selected Move:	8972	3	14	9	25300


> New Y[]: 
	
	 0  3  0  1  0  1  0  0  4  1  0  1  0  0  0  1  0  2  0  0 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,93

## ITERATION 320 #######################


> Neighbours evaluated; 80
> Selected Move:	9260	3	3	19	24800


> New Y[]: 
	
	 0  3  0  0  0  1  0  0  4  1  0  1  0  0  0  1  0  2  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0 
 > pw :0,935

## ITERATION 321 #######################


> Neighbours evaluated; 79
> Selected Move:	9073	4	17	19	25200


> New Y[]: 
	
	 0  3  0  0  0  1  0  0  4  1  0  1  0  0  0  1  0  1  0  2 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0 
 > pw :0,94

## ITERATION 322 #######################


> Neighbours evaluated; 79
> Selected Move:	9030	3	15	14	24700


> New Y[]: 
	
	 0  3  0  0  0  1  0  0  4  1  0  1  0  0  1  0  0  1  0  2 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  1 
 > pw :0,945

## ITERATION 323 #######################


> Neighbours evaluated; 81
> Selected Move:	9030	4	8	19	24900


> New Y[]: 
	
	 0  3  0  0  0  1  0  0  2  1  0  1  0  0  1  0  0  1  0  4 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  1 
 > pw :0,95

## ITERATION 324 #######################


> Neighbours evaluated; 82
> Selected Move:	9240	3	14	7	25400


> New Y[]: 
	
	 0  3  0  0  0  1  0  1  2  1  0  1  0  0  0  0  0  1  0  4 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0 
 > pw :0,955

## ITERATION 325 #######################


> Neighbours evaluated; 65
> Selected Move:	9333	4	19	17	25300


> New Y[]: 
	
	 0  3  0  0  0  1  0  1  2  1  0  1  0  0  0  0  0  4  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0 
 > pw :0,96

## ITERATION 326 #######################


> Neighbours evaluated; 76
> Selected Move:	9044	4	17	5	25600


> New Y[]: 
	
	 0  3  0  0  0  4  0  1  2  1  0  1  0  0  0  0  0  1  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0 
 > pw :0,965

## ITERATION 327 #######################


> Neighbours evaluated; 78
> Selected Move:	8933	3	7	14	25100


> New Y[]: 
	
	 0  3  0  0  0  4  0  0  2  1  0  1  0  0  1  0  0  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  1 
 > pw :0,97

## ITERATION 328 #######################


> Neighbours evaluated; 74
> Selected Move:	9030	4	5	17	24800


> New Y[]: 
	
	 0  3  0  0  0  1  0  0  2  1  0  1  0  0  1  0  0  4  0  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  1 
 > pw :0,975

## ITERATION 329 #######################


> Neighbours evaluated; 83
> Selected Move:	9030	4	8	17	24300


> New Y[]: 
	
	 0  3  0  0  0  1  0  0  4  1  0  1  0  0  1  0  0  2  0  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  1 
 > pw :0,98

## ITERATION 330 #######################


> Neighbours evaluated; 81
> Selected Move:	9030	3	17	16	24200


> New Y[]: 
	
	 0  3  0  0  0  1  0  0  4  1  0  1  0  0  1  0  2  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  1 
 > pw :0,985

## ITERATION 331 #######################


> Neighbours evaluated; 87
> Selected Move:	9030	4	8	16	24900


> New Y[]: 
	
	 0  3  0  0  0  1  0  0  2  1  0  1  0  0  1  0  4  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  1 
 > pw :0,98

## ITERATION 332 #######################


> Neighbours evaluated; 84
> Selected Move:	8970	3	8	17	24800


> New Y[]: 
	
	 0  3  0  0  0  1  0  0  0  1  0  1  0  0  1  0  4  2  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1 
 > pw :0,975

## ITERATION 333 #######################


> Neighbours evaluated; 72
> Selected Move:	8970	4	16	17	24600


> New Y[]: 
	
	 0  3  0  0  0  1  0  0  0  1  0  1  0  0  1  0  2  4  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1 
 > pw :0,97

## ITERATION 334 #######################


> Neighbours evaluated; 76
> Selected Move:	8970	4	17	5	24900


> New Y[]: 
	
	 0  3  0  0  0  4  0  0  0  1  0  1  0  0  1  0  2  1  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1 
 > pw :0,965

## ITERATION 335 #######################


> Neighbours evaluated; 66
> Selected Move:	9030	3	5	8	24700


> New Y[]: 
	
	 0  3  0  0  0  0  0  0  4  1  0  1  0  0  1  0  2  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  1 
 > pw :0,96

## ITERATION 336 #######################


> Neighbours evaluated; 43
> Selected Move:	9078	3	14	15	25200


> New Y[]: 
	
	 0  3  0  0  0  0  0  0  4  1  0  1  0  0  0  1  2  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  1 
 > pw :0,955

## ITERATION 337 #######################


> Neighbours evaluated; 41
> Selected Move:	9019	3	9	14	25200


> New Y[]: 
	
	 0  3  0  0  0  0  0  0  4  0  0  1  0  0  1  1  2  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  1 
 > pw :0,95

## ITERATION 338 #######################


> Neighbours evaluated; 46
> Selected Move:	8750	3	17	5	24700


> New Y[]: 
	
	 0  3  0  0  0  1  0  0  4  0  0  1  0  0  1  1  2  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0 
 > pw :0,945

## ITERATION 339 #######################


> Neighbours evaluated; 75
> Selected Move:	9020	3	15	7	24700


> New Y[]: 
	
	 0  3  0  0  0  1  0  1  4  0  0  1  0  0  1  0  2  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0 
 > pw :0,94

## ITERATION 340 #######################


> Neighbours evaluated; 77
> Selected Move:	9020	3	5	6	24700


> New Y[]: 
	
	 0  3  0  0  0  0  1  1  4  0  0  1  0  0  1  0  2  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0 
 > pw :0,935

## ITERATION 341 #######################


> Neighbours evaluated; 53
> Selected Move:	9020	3	14	9	24700


> New Y[]: 
	
	 0  3  0  0  0  0  1  1  4  1  0  1  0  0  0  0  2  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0 
 > pw :0,93

## ITERATION 342 #######################


> Neighbours evaluated; 68
> Selected Move:	9020	3	6	5	24700


> New Y[]: 
	
	 0  3  0  0  0  1  0  1  4  1  0  1  0  0  0  0  2  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0 
 > pw :0,925

## ITERATION 343 #######################


> Neighbours evaluated; 91
> Selected Move:	8880	3	8	18	24800


> New Y[]: 
	
	 0  3  0  0  0  1  0  1  0  1  0  1  0  0  0  0  2  0  4  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0 
 > pw :0,92

## ITERATION 344 #######################


> Neighbours evaluated; 84
> Selected Move:	9270	3	16	17	24900


> New Y[]: 
	
	 0  3  0  0  0  1  0  1  0  1  0  1  0  0  0  0  0  2  4  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  1 
 > pw :0,915

## ITERATION 345 #######################


> Neighbours evaluated; 77
> Selected Move:	8995	4	17	19	25300


> New Y[]: 
	
	 0  3  0  0  0  1  0  1  0  1  0  1  0  0  0  0  0  1  4  2 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  1 
 > pw :0,91

## ITERATION 346 #######################


> Neighbours evaluated; 81
> Selected Move:	8677	3	9	14	25300


> New Y[]: 
	
	 0  3  0  0  0  1  0  1  0  0  0  1  0  0  1  0  0  1  4  2 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  1 
 > pw :0,905

## ITERATION 347 #######################


> Neighbours evaluated; 68
> Selected Move:	8950	4	19	17	24900


> New Y[]: 
	
	 0  3  0  0  0  1  0  1  0  0  0  1  0  0  1  0  0  2  4  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  1 
 > pw :0,9

## ITERATION 348 #######################


> Neighbours evaluated; 78
> Selected Move:	8900	3	5	6	24900


> New Y[]: 
	
	 0  3  0  0  0  0  1  1  0  0  0  1  0  0  1  0  0  2  4  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0 
 > pw :0,895

## ITERATION 349 #######################


> Neighbours evaluated; 49
> Selected Move:	9030	3	18	13	24800


> New Y[]: 
	
	 0  3  0  0  0  0  1  1  0  0  0  1  0  4  1  0  0  2  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  1 
 > pw :0,89

## ITERATION 350 #######################


> Neighbours evaluated; 57
> Selected Move:	9030	3	14	9	24800


> New Y[]: 
	
	 0  3  0  0  0  0  1  1  0  1  0  1  0  4  0  0  0  2  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  1 
 > pw :0,885

## ITERATION 351 #######################


> Neighbours evaluated; 63
> Selected Move:	9072	3	6	16	25800


> New Y[]: 
	
	 0  3  0  0  0  0  0  1  0  1  0  1  0  4  0  0  1  2  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  1 
 > pw :0,88

## ITERATION 352 #######################


> Neighbours evaluated; 37
> Selected Move:	8936	3	13	8	25800


> New Y[]: 
	
	 0  3  0  0  0  0  0  1  4  1  0  1  0  0  0  0  1  2  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  1 
 > pw :0,875

## ITERATION 353 #######################


> Neighbours evaluated; 47
> Selected Move:	8780	3	16	6	24800


> New Y[]: 
	
	 0  3  0  0  0  0  1  1  4  1  0  1  0  0  0  0  0  2  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0 
 > pw :0,87

## ITERATION 354 #######################


> Neighbours evaluated; 70
> Selected Move:	8900	3	8	18	24900


> New Y[]: 
	
	 0  3  0  0  0  0  1  1  0  1  0  1  0  0  0  0  0  2  4  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0 
 > pw :0,865

## ITERATION 355 #######################


> Neighbours evaluated; 61
> Selected Move:	8880	3	17	16	24800


> New Y[]: 
	
	 0  3  0  0  0  0  1  1  0  1  0  1  0  0  0  0  2  0  4  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0 
 > pw :0,86

## ITERATION 356 #######################


> Neighbours evaluated; 64
> Selected Move:	9012	3	6	17	25300


> New Y[]: 
	
	 0  3  0  0  0  0  0  1  0  1  0  1  0  0  0  0  2  1  4  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  1 
 > pw :0,855

## ITERATION 357 #######################


> Neighbours evaluated; 72
> Selected Move:	8693	3	9	14	25300


> New Y[]: 
	
	 0  3  0  0  0  0  0  1  0  0  0  1  0  0  1  0  2  1  4  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  1 
 > pw :0,85

## ITERATION 358 #######################


> Neighbours evaluated; 66
> Selected Move:	8880	3	17	5	24800


> New Y[]: 
	
	 0  3  0  0  0  1  0  1  0  0  0  1  0  0  1  0  2  0  4  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0 
 > pw :0,845

## ITERATION 359 #######################


> Neighbours evaluated; 80
> Selected Move:	8880	3	5	6	24800


> New Y[]: 
	
	 0  3  0  0  0  0  1  1  0  0  0  1  0  0  1  0  2  0  4  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0 
 > pw :0,84

## ITERATION 360 #######################


> Neighbours evaluated; 59
> Selected Move:	8856	3	18	17	25100


> New Y[]: 
	
	 0  3  0  0  0  0  1  1  0  0  0  1  0  0  1  0  2  4  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0 
 > pw :0,845

## ITERATION 361 #######################


> Neighbours evaluated; 41
> Selected Move:	8940	3	7	9	24600


> New Y[]: 
	
	 0  3  0  0  0  0  1  0  0  1  0  1  0  0  1  0  2  4  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  1 
 > pw :0,84

## ITERATION 362 #######################


> Neighbours evaluated; 44
> Selected Move:	8940	4	16	17	24800


> New Y[]: 
	
	 0  3  0  0  0  0  1  0  0  1  0  1  0  0  1  0  4  2  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  1 
 > pw :0,835

## ITERATION 363 #######################


> Neighbours evaluated; 46
> Selected Move:	8940	3	16	13	24300


> New Y[]: 
	
	 0  3  0  0  0  0  1  0  0  1  0  1  0  4  1  0  0  2  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  1 
 > pw :0,83

## ITERATION 364 #######################


> Neighbours evaluated; 73
> Selected Move:	8940	4	17	19	24700


> New Y[]: 
	
	 0  3  0  0  0  0  1  0  0  1  0  1  0  4  1  0  0  1  0  2 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  1 
 > pw :0,825

## ITERATION 365 #######################


> Neighbours evaluated; 72
> Selected Move:	8940	3	19	16	24700


> New Y[]: 
	
	 0  3  0  0  0  0  1  0  0  1  0  1  0  4  1  0  2  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  1  0  0 
 > pw :0,82

## ITERATION 366 #######################


> Neighbours evaluated; 71
> Selected Move:	8970	3	6	5	24700


> New Y[]: 
	
	 0  3  0  0  0  1  0  0  0  1  0  1  0  4  1  0  2  1  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0 
 > pw :0,815

## ITERATION 367 #######################


> Neighbours evaluated; 91
> Selected Move:	8970	3	13	8	24700


> New Y[]: 
	
	 0  3  0  0  0  1  0  0  4  1  0  1  0  0  1  0  2  1  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,81

## ITERATION 368 #######################


> Neighbours evaluated; 87
> Selected Move:	9030	3	17	3	24700


> New Y[]: 
	
	 0  3  0  1  0  1  0  0  4  1  0  1  0  0  1  0  2  0  0  0 


> New S[]: 
	
	 0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,805

## ITERATION 369 #######################


> Neighbours evaluated; 101
> Selected Move:	8889	3	8	17	25100


> New Y[]: 
	
	 0  3  0  1  0  1  0  0  0  1  0  1  0  0  1  0  2  4  0  0 


> New S[]: 
	
	 0  1  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,8

## ITERATION 370 #######################


> Neighbours evaluated; 86
> Selected Move:	8810	4	17	3	25200


> New Y[]: 
	
	 0  3  0  4  0  1  0  0  0  1  0  1  0  0  1  0  2  1  0  0 


> New S[]: 
	
	 0  1  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,795

## ITERATION 371 #######################


> Neighbours evaluated; 79
> Selected Move:	8970	3	3	19	24700


> New Y[]: 
	
	 0  3  0  0  0  1  0  0  0  1  0  1  0  0  1  0  2  1  0  4 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1 
 > pw :0,79

## ITERATION 372 #######################


> Neighbours evaluated; 79
> Selected Move:	8940	3	5	6	24700


> New Y[]: 
	
	 0  3  0  0  0  0  1  0  0  1  0  1  0  0  1  0  2  1  0  4 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  1 
 > pw :0,785

## ITERATION 373 #######################


> Neighbours evaluated; 53
> Selected Move:	8890	3	16	8	24900


> New Y[]: 
	
	 0  3  0  0  0  0  1  0  2  1  0  1  0  0  1  0  0  1  0  4 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1 
 > pw :0,78

## ITERATION 374 #######################


> Neighbours evaluated; 68
> Selected Move:	8890	4	8	19	24700


> New Y[]: 
	
	 0  3  0  0  0  0  1  0  4  1  0  1  0  0  1  0  0  1  0  2 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1 
 > pw :0,775

## ITERATION 375 #######################


> Neighbours evaluated; 65
> Selected Move:	8890	4	19	17	24300


> New Y[]: 
	
	 0  3  0  0  0  0  1  0  4  1  0  1  0  0  1  0  0  2  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1 
 > pw :0,77

## ITERATION 376 #######################


> Neighbours evaluated; 78
> Selected Move:	8890	4	8	17	24800


> New Y[]: 
	
	 0  3  0  0  0  0  1  0  2  1  0  1  0  0  1  0  0  4  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1 
 > pw :0,765

## ITERATION 377 #######################


> Neighbours evaluated; 73
> Selected Move:	8890	3	17	16	24900


> New Y[]: 
	
	 0  3  0  0  0  0  1  0  2  1  0  1  0  0  1  0  4  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1 
 > pw :0,76

## ITERATION 378 #######################


> Neighbours evaluated; 67
> Selected Move:	8890	4	8	16	24200


> New Y[]: 
	
	 0  3  0  0  0  0  1  0  4  1  0  1  0  0  1  0  2  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1 
 > pw :0,755

## ITERATION 379 #######################


> Neighbours evaluated; 80
> Selected Move:	8890	3	19	17	24700


> New Y[]: 
	
	 0  3  0  0  0  0  1  0  4  1  0  1  0  0  1  0  2  1  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0 
 > pw :0,75

## ITERATION 380 #######################


> Neighbours evaluated; 72
> Selected Move:	8880	3	6	3	25200


> New Y[]: 
	
	 0  3  0  1  0  0  0  0  4  1  0  1  0  0  1  0  2  1  0  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0 
 > pw :0,745

## ITERATION 381 #######################


> Neighbours evaluated; 71
> Selected Move:	9098	3	14	7	25700


> New Y[]: 
	
	 0  3  0  1  0  0  0  1  4  1  0  1  0  0  0  0  2  1  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0 
 > pw :0,74

## ITERATION 382 #######################


> Neighbours evaluated; 60
> Selected Move:	9142	3	8	13	25700


> New Y[]: 
	
	 0  3  0  1  0  0  0  1  0  1  0  1  0  4  0  0  2  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  1  0  0 
 > pw :0,735

## ITERATION 383 #######################


> Neighbours evaluated; 56
> Selected Move:	8903	3	7	14	25200


> New Y[]: 
	
	 0  3  0  1  0  0  0  0  0  1  0  1  0  4  1  0  2  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  1  0  0 
 > pw :0,73

## ITERATION 384 #######################


> Neighbours evaluated; 73
> Selected Move:	8870	3	17	6	24700


> New Y[]: 
	
	 0  3  0  1  0  0  1  0  0  1  0  1  0  4  1  0  2  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0 
 > pw :0,725

## ITERATION 385 #######################


> Neighbours evaluated; 83
> Selected Move:	9015	3	9	7	25200


> New Y[]: 
	
	 0  3  0  1  0  0  1  1  0  0  0  1  0  4  1  0  2  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0 
 > pw :0,73

## ITERATION 386 #######################


> Neighbours evaluated; 56
> Selected Move:	8904	3	7	15	25200


> New Y[]: 
	
	 0  3  0  1  0  0  1  0  0  0  0  1  0  4  1  1  2  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0 
 > pw :0,735

## ITERATION 387 #######################


> Neighbours evaluated; 51
> Selected Move:	8913	3	14	9	25200


> New Y[]: 
	
	 0  3  0  1  0  0  1  0  0  1  0  1  0  4  0  1  2  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0 
 > pw :0,74

## ITERATION 388 #######################


> Neighbours evaluated; 80
> Selected Move:	8772	3	6	17	25700


> New Y[]: 
	
	 0  3  0  1  0  0  0  0  0  1  0  1  0  4  0  1  2  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  1  0  0 
 > pw :0,745

## ITERATION 389 #######################


> Neighbours evaluated; 68
> Selected Move:	8728	3	13	8	25700


> New Y[]: 
	
	 0  3  0  1  0  0  0  0  4  1  0  1  0  0  0  1  2  1  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0 
 > pw :0,75

## ITERATION 390 #######################


> Neighbours evaluated; 70
> Selected Move:	8685	3	9	14	25700


> New Y[]: 
	
	 0  3  0  1  0  0  0  0  4  0  0  1  0  0  1  1  2  1  0  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0 
 > pw :0,755

## ITERATION 391 #######################


> Neighbours evaluated; 48
> Selected Move:	8791	3	15	7	25700


> New Y[]: 
	
	 0  3  0  1  0  0  0  1  4  0  0  1  0  0  1  0  2  1  0  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0 
 > pw :0,76

## ITERATION 392 #######################


> Neighbours evaluated; 43
> Selected Move:	8878	3	17	5	25200


> New Y[]: 
	
	 0  3  0  1  0  1  0  1  4  0  0  1  0  0  1  0  2  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0 
 > pw :0,765

## ITERATION 393 #######################


> Neighbours evaluated; 91
> Selected Move:	8877	3	5	6	25200


> New Y[]: 
	
	 0  3  0  1  0  0  1  1  4  0  0  1  0  0  1  0  2  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0 
 > pw :0,77

## ITERATION 394 #######################


> Neighbours evaluated; 60
> Selected Move:	8876	3	14	9	25200


> New Y[]: 
	
	 0  3  0  1  0  0  1  1  4  1  0  1  0  0  0  0  2  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0 
 > pw :0,775

## ITERATION 395 #######################


> Neighbours evaluated; 73
> Selected Move:	8875	3	6	5	25200


> New Y[]: 
	
	 0  3  0  1  0  1  0  1  4  1  0  1  0  0  0  0  2  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0 
 > pw :0,78

## ITERATION 396 #######################


> Neighbours evaluated; 96
> Selected Move:	8694	3	3	4	25200


> New Y[]: 
	
	 0  3  0  0  1  1  0  1  4  1  0  1  0  0  0  0  2  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0 
 > pw :0,785

## ITERATION 397 #######################


> Neighbours evaluated; 82
> Selected Move:	9233	3	8	13	25200


> New Y[]: 
	
	 0  3  0  0  1  1  0  1  0  1  0  1  0  4  0  0  2  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  1  0  0  0 
 > pw :0,79

## ITERATION 398 #######################


> Neighbours evaluated; 77
> Selected Move:	9153	3	16	17	25300


> New Y[]: 
	
	 0  3  0  0  1  1  0  1  0  1  0  1  0  4  0  0  0  2  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  1  0  0 
 > pw :0,795

## ITERATION 399 #######################


> Neighbours evaluated; 80
> Selected Move:	9151	3	13	8	25300


> New Y[]: 
	
	 0  3  0  0  1  1  0  1  4  1  0  1  0  0  0  0  0  2  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,8

## ITERATION 400 #######################


> Neighbours evaluated; 85
> Selected Move:	8830	3	9	14	25300


> New Y[]: 
	
	 0  3  0  0  1  1  0  1  4  0  0  1  0  0  1  0  0  2  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,805

## ITERATION 401 #######################


> Neighbours evaluated; 68
> Selected Move:	8909	4	17	4	25200


> New Y[]: 
	
	 0  3  0  0  2  1  0  1  4  0  0  1  0  0  1  0  0  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,81

## ITERATION 402 #######################


> Neighbours evaluated; 76
> Selected Move:	8908	3	8	13	25200


> New Y[]: 
	
	 0  3  0  0  2  1  0  1  0  0  0  1  0  4  1  0  0  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  1  0  0 
 > pw :0,815

## ITERATION 403 #######################


> Neighbours evaluated; 71
> Selected Move:	8851	3	4	3	25600


> New Y[]: 
	
	 0  3  0  2  0  1  0  1  0  0  0  1  0  4  1  0  0  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  1  0  0 
 > pw :0,82

## ITERATION 404 #######################


> Neighbours evaluated; 69
> Selected Move:	9168	3	14	9	25600


> New Y[]: 
	
	 0  3  0  2  0  1  0  1  0  1  0  1  0  4  0  0  0  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  1  0  0 
 > pw :0,825

## ITERATION 405 #######################


> Neighbours evaluated; 79
> Selected Move:	8967	3	7	14	25100


> New Y[]: 
	
	 0  3  0  2  0  1  0  0  0  1  0  1  0  4  1  0  0  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  1  0  0 
 > pw :0,83

## ITERATION 406 #######################


> Neighbours evaluated; 87
> Selected Move:	8947	3	13	8	25100


> New Y[]: 
	
	 0  3  0  2  0  1  0  0  4  1  0  1  0  0  1  0  0  1  0  0 


> New S[]: 
	
	 0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,835

## ITERATION 407 #######################


> Neighbours evaluated; 88
> Selected Move:	8819	3	9	7	25600


> New Y[]: 
	
	 0  3  0  2  0  1  0  1  4  0  0  1  0  0  1  0  0  1  0  0 


> New S[]: 
	
	 0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,84

## ITERATION 408 #######################


> Neighbours evaluated; 79
> Selected Move:	8706	3	7	15	25600


> New Y[]: 
	
	 0  3  0  2  0  1  0  0  4  0  0  1  0  0  1  1  0  1  0  0 


> New S[]: 
	
	 0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,845

## ITERATION 409 #######################


> Neighbours evaluated; 61
> Selected Move:	8791	3	3	4	25200


> New Y[]: 
	
	 0  3  0  0  2  1  0  0  4  0  0  1  0  0  1  1  0  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,85

## ITERATION 410 #######################


> Neighbours evaluated; 60
> Selected Move:	8850	3	14	9	25200


> New Y[]: 
	
	 0  3  0  0  2  1  0  0  4  1  0  1  0  0  0  1  0  1  0  0 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,855

## ITERATION 411 #######################


> Neighbours evaluated; 84
> Selected Move:	8849	3	8	13	25200


> New Y[]: 
	
	 0  3  0  0  2  1  0  0  0  1  0  1  0  4  0  1  0  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  1  0  0 
 > pw :0,86

## ITERATION 412 #######################


> Neighbours evaluated; 81
> Selected Move:	8878	3	11	14	25200


> New Y[]: 
	
	 0  3  0  0  2  1  0  0  0  1  0  0  0  4  1  1  0  1  0  0 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,865

## ITERATION 413 #######################


> Neighbours evaluated; 92
> Selected Move:	8877	3	4	19	25200


> New Y[]: 
	
	 0  3  0  0  0  1  0  0  0  1  0  0  0  4  1  1  0  1  0  2 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  1 
 > pw :0,87

## ITERATION 414 #######################


> Neighbours evaluated; 82
> Selected Move:	9106	3	15	7	25200


> New Y[]: 
	
	 0  3  0  0  0  1  0  1  0  1  0  0  0  4  1  0  0  1  0  2 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  1 
 > pw :0,875

## ITERATION 415 #######################


> Neighbours evaluated; 85
> Selected Move:	8787	3	7	4	25700


> New Y[]: 
	
	 0  3  0  0  1  1  0  0  0  1  0  0  0  4  1  0  0  1  0  2 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  1  0  0  0  0  1  0  0  0  0  0 
 > pw :0,88

## ITERATION 416 #######################


> Neighbours evaluated; 89
> Selected Move:	8600	3	19	0	24100


> New Y[]: 
	
	 2  3  0  0  1  1  0  0  0  1  0  0  0  4  1  0  0  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  1  0  0  0  0  1  0  0  0  0  0 
 > pw :0,885

## ITERATION 417 #######################


> Neighbours evaluated; 92
> Selected Move:	8660	3	4	3	24100


> New Y[]: 
	
	 2  3  0  1  0  1  0  0  0  1  0  0  0  4  1  0  0  1  0  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0 
 > pw :0,89

## ITERATION 418 #######################


> Neighbours evaluated; 100
> Selected Move:	8670	3	17	16	24600


> New Y[]: 
	
	 2  3  0  1  0  1  0  0  0  1  0  0  0  4  1  0  1  0  0  0 


> New S[]: 
	
	 0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,895

## ITERATION 419 #######################


> Neighbours evaluated; 94
> Selected Move:	8850	3	13	19	24600


> New Y[]: 
	
	 2  3  0  1  0  1  0  0  0  1  0  0  0  0  1  0  1  0  0  4 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  1  0  0  0 
 > pw :0,9

## ITERATION 420 #######################


> Neighbours evaluated; 89
> Selected Move:	8850	4	19	3	24600


> New Y[]: 
	
	 2  3  0  4  0  1  0  0  0  1  0  0  0  0  1  0  1  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  1  0  0  0 
 > pw :0,905

## ITERATION 421 #######################


> Neighbours evaluated; 89
> Selected Move:	8850	4	3	5	24800


> New Y[]: 
	
	 2  3  0  1  0  4  0  0  0  1  0  0  0  0  1  0  1  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  1  0  0  0 
 > pw :0,9

## ITERATION 422 #######################


> Neighbours evaluated; 86
> Selected Move:	8850	4	5	16	24100


> New Y[]: 
	
	 2  3  0  1  0  1  0  0  0  1  0  0  0  0  1  0  4  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  1  0  0  0 
 > pw :0,895

## ITERATION 423 #######################


> Neighbours evaluated; 94
> Selected Move:	8671	4	16	9	25200


> New Y[]: 
	
	 2  3  0  1  0  1  0  0  0  4  0  0  0  0  1  0  1  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  1  0  0  0 
 > pw :0,89

## ITERATION 424 #######################


> Neighbours evaluated; 90
> Selected Move:	8462	3	3	4	25200


> New Y[]: 
	
	 2  3  0  0  1  1  0  0  0  4  0  0  0  0  1  0  1  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  1 
 > pw :0,885

## ITERATION 425 #######################


> Neighbours evaluated; 79
> Selected Move:	8640	4	9	4	24100


> New Y[]: 
	
	 2  3  0  0  4  1  0  0  0  1  0  0  0  0  1  0  1  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  1 
 > pw :0,88

## ITERATION 426 #######################


> Neighbours evaluated; 86
> Selected Move:	8746	3	1	13	25800


> New Y[]: 
	
	 2  0  0  0  4  1  0  0  0  1  0  0  0  3  1  0  1  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  1 
 > pw :0,875

## ITERATION 427 #######################


> Neighbours evaluated; 86
> Selected Move:	9247	3	16	17	25300


> New Y[]: 
	
	 2  0  0  0  4  1  0  0  0  1  0  0  0  3  1  0  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0 
 > pw :0,87

## ITERATION 428 #######################


> Neighbours evaluated; 86
> Selected Move:	9423	4	4	13	25100


> New Y[]: 
	
	 2  0  0  0  3  1  0  0  0  1  0  0  0  4  1  0  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0 
 > pw :0,875

## ITERATION 429 #######################


> Neighbours evaluated; 97
> Selected Move:	9192	3	19	7	25100


> New Y[]: 
	
	 2  0  0  0  3  1  0  1  0  1  0  0  0  4  1  0  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,88

## ITERATION 430 #######################


> Neighbours evaluated; 92
> Selected Move:	9442	3	14	11	25100


> New Y[]: 
	
	 2  0  0  0  3  1  0  1  0  1  0  1  0  4  0  0  0  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  1  0  0 
 > pw :0,885

## ITERATION 431 #######################


> Neighbours evaluated; 66
> Selected Move:	9583	3	4	3	25200


> New Y[]: 
	
	 2  0  0  3  0  1  0  1  0  1  0  1  0  4  0  0  0  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  1  0  0 
 > pw :0,89

## ITERATION 432 #######################


> Neighbours evaluated; 85
> Selected Move:	9442	3	13	8	25200


> New Y[]: 
	
	 2  0  0  3  0  1  0  1  4  1  0  1  0  0  0  0  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,895

## ITERATION 433 #######################


> Neighbours evaluated; 89
> Selected Move:	9300	3	3	4	25100


> New Y[]: 
	
	 2  0  0  0  3  1  0  1  4  1  0  1  0  0  0  0  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,9

## ITERATION 434 #######################


> Neighbours evaluated; 92
> Selected Move:	8940	3	9	14	25100


> New Y[]: 
	
	 2  0  0  0  3  1  0  1  4  0  0  1  0  0  1  0  0  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,905

## ITERATION 435 #######################


> Neighbours evaluated; 86
> Selected Move:	9079	3	4	3	25200


> New Y[]: 
	
	 2  0  0  3  0  1  0  1  4  0  0  1  0  0  1  0  0  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,91

## ITERATION 436 #######################


> Neighbours evaluated; 93
> Selected Move:	9078	3	8	13	25200


> New Y[]: 
	
	 2  0  0  3  0  1  0  1  0  0  0  1  0  4  1  0  0  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  1  0  0 
 > pw :0,915

## ITERATION 437 #######################


> Neighbours evaluated; 81
> Selected Move:	9097	3	11	9	25200


> New Y[]: 
	
	 2  0  0  3  0  1  0  1  0  1  0  0  0  4  1  0  0  1  0  0 


> New S[]: 
	
	 1  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,92

## ITERATION 438 #######################


> Neighbours evaluated; 98
> Selected Move:	8970	3	7	11	24700


> New Y[]: 
	
	 2  0  0  3  0  1  0  0  0  1  0  1  0  4  1  0  0  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  1  0  0 
 > pw :0,925

## ITERATION 439 #######################


> Neighbours evaluated; 92
> Selected Move:	9205	3	14	15	25200


> New Y[]: 
	
	 2  0  0  3  0  1  0  0  0  1  0  1  0  4  0  1  0  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  1  0  0 
 > pw :0,93

## ITERATION 440 #######################


> Neighbours evaluated; 86
> Selected Move:	9067	3	3	4	25100


> New Y[]: 
	
	 2  0  0  0  3  1  0  0  0  1  0  1  0  4  0  1  0  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  1  0  0 
 > pw :0,935

## ITERATION 441 #######################


> Neighbours evaluated; 84
> Selected Move:	8956	3	11	14	25100


> New Y[]: 
	
	 2  0  0  0  3  1  0  0  0  1  0  0  0  4  1  1  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,94

## ITERATION 442 #######################


> Neighbours evaluated; 96
> Selected Move:	8862	3	4	3	25200


> New Y[]: 
	
	 2  0  0  3  0  1  0  0  0  1  0  0  0  4  1  1  0  1  0  0 


> New S[]: 
	
	 1  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,945

## ITERATION 443 #######################


> Neighbours evaluated; 100
> Selected Move:	8961	3	9	11	25200


> New Y[]: 
	
	 2  0  0  3  0  1  0  0  0  0  0  1  0  4  1  1  0  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  1  0  0 
 > pw :0,95

## ITERATION 444 #######################


> Neighbours evaluated; 77
> Selected Move:	8960	3	13	8	25200


> New Y[]: 
	
	 2  0  0  3  0  1  0  0  4  0  0  1  0  0  1  1  0  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,955

## ITERATION 445 #######################


> Neighbours evaluated; 76
> Selected Move:	9059	3	14	9	25200


> New Y[]: 
	
	 2  0  0  3  0  1  0  0  4  1  0  1  0  0  0  1  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,96

## ITERATION 446 #######################


> Neighbours evaluated; 91
> Selected Move:	8970	3	15	14	24700


> New Y[]: 
	
	 2  0  0  3  0  1  0  0  4  1  0  1  0  0  1  0  0  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,965

## ITERATION 447 #######################


> Neighbours evaluated; 98
> Selected Move:	8800	3	5	6	24700


> New Y[]: 
	
	 2  0  0  3  0  0  1  0  4  1  0  1  0  0  1  0  0  1  0  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,97

## ITERATION 448 #######################


> Neighbours evaluated; 86
> Selected Move:	8800	3	8	13	24700


> New Y[]: 
	
	 2  0  0  3  0  0  1  0  0  1  0  1  0  4  1  0  0  1  0  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0 
 > pw :0,975

## ITERATION 449 #######################


> Neighbours evaluated; 85
> Selected Move:	8915	3	14	7	25200


> New Y[]: 
	
	 2  0  0  3  0  0  1  1  0  1  0  1  0  4  0  0  0  1  0  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,98

## ITERATION 450 #######################


> Neighbours evaluated; 67
> Selected Move:	9012	3	3	4	25100


> New Y[]: 
	
	 2  0  0  0  3  0  1  1  0  1  0  1  0  4  0  0  0  1  0  0 


> New S[]: 
	
	 0  0  0  0  1  0  0  1  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,985

## ITERATION 451 #######################


> Neighbours evaluated; 64
> Selected Move:	8831	3	9	14	25100


> New Y[]: 
	
	 2  0  0  0  3  0  1  1  0  0  0  1  0  4  1  0  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0 
 > pw :0,99

## ITERATION 452 #######################


> Neighbours evaluated; 41
> Selected Move:	8931	3	6	5	25100


> New Y[]: 
	
	 2  0  0  0  3  1  0  1  0  0  0  1  0  4  1  0  0  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  1  0  0 
 > pw :0,995

## ITERATION 453 #######################


> Neighbours evaluated; 72
> Selected Move:	8860	3	7	19	25100


> New Y[]: 
	
	 2  0  0  0  3  1  0  0  0  0  0  1  0  4  1  0  0  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  1  0  0 
 > pw :1

## ITERATION 454 #######################


> Neighbours evaluated; 66
> Selected Move:	8950	3	14	9	25100


> New Y[]: 
	
	 2  0  0  0  3  1  0  0  0  1  0  1  0  4  0  0  0  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  1  0  0 
 > pw :1,005

## ITERATION 455 #######################


> Neighbours evaluated; 80
> Selected Move:	9146	3	4	7	25800


> New Y[]: 
	
	 2  0  0  0  0  1  0  3  0  1  0  1  0  4  0  0  0  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  1 
 > pw :1,01

## ITERATION 456 #######################


> Neighbours evaluated; 48
> Selected Move:	9546	4	7	17	25400


> New Y[]: 
	
	 2  0  0  0  0  1  0  1  0  1  0  1  0  4  0  0  0  3  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  1 
 > pw :1,015

## ITERATION 457 #######################


> Neighbours evaluated; 51
> Selected Move:	9747	4	13	17	25200


> New Y[]: 
	
	 2  0  0  0  0  1  0  1  0  1  0  1  0  3  0  0  0  4  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  1 
 > pw :1,02

## ITERATION 458 #######################


> Neighbours evaluated; 62
> Selected Move:	9644	4	17	19	25300


> New Y[]: 
	
	 2  0  0  0  0  1  0  1  0  1  0  1  0  3  0  0  0  1  0  4 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  1 
 > pw :1,025

## ITERATION 459 #######################


> Neighbours evaluated; 65
> Selected Move:	9438	4	19	5	25500


> New Y[]: 
	
	 2  0  0  0  0  4  0  1  0  1  0  1  0  3  0  0  0  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  1 
 > pw :1,03

## ITERATION 460 #######################


> Neighbours evaluated; 64
> Selected Move:	9170	3	7	14	25000


> New Y[]: 
	
	 2  0  0  0  0  4  0  0  0  1  0  1  0  3  1  0  0  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  1  0  0 
 > pw :1,035

## ITERATION 461 #######################


> Neighbours evaluated; 79
> Selected Move:	9170	4	5	17	24700


> New Y[]: 
	
	 2  0  0  0  0  1  0  0  0  1  0  1  0  3  1  0  0  4  0  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  1  0  0 
 > pw :1,04

## ITERATION 462 #######################


> Neighbours evaluated; 86
> Selected Move:	9382	3	14	15	25200


> New Y[]: 
	
	 2  0  0  0  0  1  0  0  0  1  0  1  0  3  0  1  0  4  0  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  1  0  0 
 > pw :1,045
________________________________________________________________

Best solution found: 9780
Run Termination time: 31.01.2010 13:00:53
Run duration: 00:23:12.3750000
________________________________________________________________
